Expression Tree with Example in C++

An expression tree is a special type of binary tree in which each node of the tree either consists of an operator or operand.

Leaf nodes of the tree represent an operand.
Non-leaf nodes of the tree represent an operator.

Example:

To get the infix expression which can be easily solved, we need to traverse the tree using inorder traversal. 

sudhir sharma

Updated on: 22-Jan-2021

289 Views

Kickstart Your Career

Get certified by completing the course

Get Started