Binary expression tree
From Wiki @ Karl Jones dot com
Revision as of 12:33, 20 February 2016 by Karl Jones (Talk | contribs)
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
- Algebra
- Binary tree
- Boolean algebra
- [[Expression (mathematics)
- Mathematics
- Node (computer science)
External links
- Binary expression tree @ Wikipedia
