View source for Binary expression tree

A '''binary expression tree''' is a specific kind of a [[binary tree]] used to represent [[Expression (mathematics)|expressions]].

== Description ==

Two common types of expressions that a binary expression tree can represent:

* [[Algebra|Algebraic]]
* [[Boolean algebra|Boolean]]

These trees can represent expressions that contain both unary and binary operators.

Each [[node (computer science)|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 (computer science)]]
* [[Expression (mathematics)]]
* [[Mathematics]]
* [[Node (computer science)]]

==  External links ==

* [https://en.wikipedia.org/wiki/Binary_expression_tree Binary expression tree] @ Wikipedia