Binary expression tree

From Wiki @ Karl Jones dot com
Revision as of 12:55, 20 February 2016 by Karl Jones (Talk | contribs) (See also)

Jump to: navigation, search

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