Expression Tree Multiple choice Questions and Answers (MCQs)

 

 Help authour, Buy PDF Ebook   >>>Click Here<<<

Expression Tree Multiple choice Questions and Answers (MCQs)

Click on any option to know the CORRECT ANSWERS

Question 6
The average depth of a binary tree is given as?
A
O(N)
B
O(log N)
C
O(M log N)
D
O(√N)
English literature Questions answers

Question 6 Explanation: 
The average depth of a binary expression tree is mathematically found to be O(√N).

Question 7
Only infix expression can be made into an expression tree.
A
true
B
false
Microbiology Questions answers

Question 7 Explanation: 
All infi, x prefix and postfix expressions can be made into an expression tree using appropriate algorithms.

Question 8
An expression tree is created using?
A
postfix expression
B
prefix expression
C
infix expression
D
paranthesized expression
Journalism Questions answers

Question 8 Explanation: 
A postfix expression is converted into an expression tree by reading one symbol at a time and constructing a tree respectively.

Question 9
++a*bc*+defg is an?
A
postfix expression
B
infix expression
C
prefix expression
D
invalid expression
Geography Questions answers

Question 9 Explanation: 
It is a prefix expression obtained from a preorder traversal since it is of the form operator-operand-operand.

Question 10
An expression tree's nodes can be deleted by calling?
A
malloc
B
calloc
C
delete
D
free
Computer science Questions answers

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.

 

 Download all FREE PDF Ebook >>>CLICK HERE<<<