Talk:Binary expression tree

Computer science Start‑class Low‑importance

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science

Start

This article has been rated as Start-class on Wikipedia's content assessment scale.

Low

This article has been rated as Low-importance on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

about the article

I am not sure whether 'construction of an expression tree' should be a subheading to Overview. PratikNadagouda (talk) 17:51, 12 September 2011 (UTC)[reply]

Example

The input is: a b + c d e + * *

Since the first two symbols are operands, one-node trees are created and pointers are pushed to them 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 to 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 '*' is read. The last two tree pointers are popped and a new tree is formed with a '*' as the root.

Finally, the last symbol is read. The two trees are merged and a pointer to the final tree remains on the stack.^[1] PratikNadagouda (talk) 18:10, 14 September 2011 (UTC)[reply]

^ Cite error: The named reference Gopal2010 was invoked but never defined (see the help page).

[Gopal2010-1] Cite error: The named reference Gopal2010 was invoked but never defined (see the help page).

[1]