Difference between revisions of "Binary expression tree"
From Wiki @ Karl Jones dot com
Karl Jones (Talk | contribs) |
Karl Jones (Talk | contribs) (→See also) |
||
| Line 19: | Line 19: | ||
* [[Binary tree]] | * [[Binary tree]] | ||
* [[Boolean algebra]] | * [[Boolean algebra]] | ||
| − | * [[Expression (mathematics) | + | * [[Expression (mathematics)]] |
* [[Mathematics]] | * [[Mathematics]] | ||
* [[Node (computer science)]] | * [[Node (computer science)]] | ||
Revision as of 12:33, 20 February 2016
A binary expression tree is a specific kind of a binary tree used to represent expressions.
Description
Two common types of expressions that a binary expression tree can represent:
These trees can represent expressions that contain both unary and binary operators.
Each node of a binary tree, and hence of a binary expression tree, has zero, one, or two children.
This restricted structure simplifies the processing of expression trees.
See also
External links
- Binary expression tree @ Wikipedia
