binary trees constructing the expression tree involves performing one of five different steps for each token in the expression this same process can be used on larger expressions to construct each part of the tree consider figure which illustrates the steps required to build the tree for the expression (( * )+ the steps illustrated in the figure are described below* ( ( * ( ( ( ( ( * ( ( ( figure steps for building an expression tree for (( create an empty root node and mark it as the current node read the left parenthesisadd new node as the left child and descend down to the new node read the next left parenthesisadd new node as the left child and descend down to the new node read the operand set the value of the current node to the operand and move up to the parent of the current node read the operator *set the value of the current node to the operator and create new node linked as the right child then descend down to the new node read the operand set the value of the current node to the operand and move up to the parent of the current node read the right parenthesismove up to the parent of the current node read the operator +set the value of the current node to the operator and create new node linked as the right childdescend down to the new node