GNU social JP
  • FAQ
  • Login
GNU social JPは日本のGNU socialサーバーです。
Usage/ToS/admin/test/Pleroma FE
  • Public

    • Public
    • Network
    • Groups
    • Featured
    • Popular
    • People

Embed Notice

HTML Code

Corresponding Notice

  1. Embed this notice
    Matt Cengia (mattcen@aus.social)'s status on Saturday, 07-Jun-2025 09:52:56 JSTMatt CengiaMatt Cengia
    in reply to
    • Paul Cantrell

    @inthehands Firstly, consider what context a *sighted* person would need to know to understand a diagram like this for the very first time. Write accompanying text to facilitate that context. Then describe each tree individually (as separate images) verbatim. The context should not be part of the alt text; that gives more info to folks who read alt text to those who don't, which isn't the intent of alt text.
    I'd take inspiration from places like https://en.wikipedia.org/wiki/Binary_expression_tree and https://www.geeksforgeeks.org/expression-tree/.

    In conversationabout 4 months ago from aus.socialpermalink

    Attachments

    1. Domain not in remote thumbnail source whitelist: login.wikimedia.org
      Binary expression tree
      A binary expression tree is a specific kind of a binary tree used to represent expressions. Two common types of expressions that a binary expression tree can represent are algebraic and boolean. These trees can represent expressions that contain both unary and binary operators. Like any binary tree, each node of a binary expression tree has zero, one, or two children. This restricted structure simplifies the processing of expression trees. Construction of an expression tree Example The input in postfix notation is: a b + c d e + * * Since the first two symbols are operands, one-node trees are created and pointers to them are pushed onto a stack. For convenience the stack will grow from left to right. The next symbol is a '+'. It pops the two pointers to the trees, a new tree is formed, and a pointer to it is pushed onto the stack. Next, c, d, and e are read. A one-node tree is created for each and a pointer to the corresponding tree is pushed onto the stack. Continuing, a '+' is read, and it merges the last two trees. Now, a ...
    2. Domain not in remote thumbnail source whitelist: media.geeksforgeeks.org
      Expression Tree - GeeksforGeeks
      Your All-in-One Learning Portal: GeeksforGeeks is a comprehensive educational platform that empowers learners across domains-spanning computer science and programming, school education, upskilling, commerce, software tools, competitive exams, and more.
  • Help
  • About
  • FAQ
  • TOS
  • Privacy
  • Source
  • Version
  • Contact

GNU social JP is a social network, courtesy of GNU social JP管理人. It runs on GNU social, version 2.0.2-dev, available under the GNU Affero General Public License.

Creative Commons Attribution 3.0 All GNU social JP content and data are available under the Creative Commons Attribution 3.0 license.