Expression Tree Multiple choice Questions and Answers (MCQs)
Click on any option to know the CORRECT ANSWERS
The average depth of a binary tree is given as?
O(M log N)
Question 6 Explanation:
The average depth of a binary expression tree is mathematically found to be O(√N).
Only infix expression can be made into an expression tree.
Question 7 Explanation:
All infi, x prefix and postfix expressions can be made into an expression tree using appropriate algorithms.
An expression tree is created using?
Question 8 Explanation:
A postfix expression is converted into an expression tree by reading one symbol at a time and constructing a tree respectively.
++a*bc*+defg is an?
Question 9 Explanation:
It is a prefix expression obtained from a preorder traversal since it is of the form operator-operand-operand.
An expression tree's nodes can be deleted by calling?
Question 10 Explanation:
In Binary trees, nodes are created by calling malloc and they are deleted by calling free.
There are 10 questions to complete.