Difference between revisions of "Binary expression tree"

From Wiki @ Karl Jones dot com
Jump to: navigation, search
(See also)
(External links)
 
Line 27: Line 27:
  
 
* [https://en.wikipedia.org/wiki/Binary_expression_tree Binary expression tree] @ Wikipedia
 
* [https://en.wikipedia.org/wiki/Binary_expression_tree Binary expression tree] @ Wikipedia
 +
 +
[[Category:Computer science]]
 +
[[Category:Logic]]
 +
[[Category:Mathematics]]

Latest revision as of 08:17, 21 April 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