Question

Write a python program to construct a binary tree from an arithmetic expression given in prefix notation. For your reference, the algorithm has been mentioned below with an example. Do your own correctness check of the algorithm and code. Example: infix expression ((21 * (51 - 10)) * (3 * 11)) its corresponding prefix expression: + 21 - 51 10 * 3 * 11 function buildBinaryTree() input('next-token', t) if t in '+', '-', '*', '/' then { X = create_node() X.data = t X.left = buildBinaryTree() X.right = buildBinaryTree() } else { X = create_node() X.data = int(t) X.left = none X.right = none } return(X)

          Write a python program to construct a binary tree from an arithmetic expression given in prefix
notation.
For your reference, the algorithm has been mentioned below with an example. Do your own
correctness check of the algorithm and code.
Example: infix expression ((21 * (51 - 10)) * (3 * 11)) its corresponding
prefix expression: + 21 - 51 10 * 3 * 11
function buildBinaryTree()
input('next-token', t)
if t in '+', '-', '*', '/' then {
X = create_node()
X.data = t
X.left = buildBinaryTree()
X.right = buildBinaryTree()
}
else {
X = create_node()
X.data = int(t)
X.left = none
X.right = none
}
return(X)

Write a python program to construct a binary tree from an arithmetic expression given in prefix
notation.
For your reference, the algorithm has been mentioned below with an example. Do your own
correctness check of the algorithm and code.
Example: infix expression ((21 * (51 - 10)) * (3 * 11)) its corresponding
prefix expression: + 21 - 51 10 * 3 * 11
function buildBinaryTree()
input('next-token', t)
if t in '+', '-', '*', '/' then
X = createnode()
X.data = t
X.left = buildBinaryTree()
X.right = buildBinaryTree()

else
X = createnode()
X.data = int(t)
X.left = none
X.right = none

return(X)

Added by David A.

Question

Please give Ace some feedback