TREE
1.
In which of the tree traversal method root node is always
visited first.
A. Inorder
B. Preorder
C. Postorder
D. In all of the above
Answer: B
2.
In which of the tree traversal method elements gets
visited in an ascending order.
A. Inorder
B. Preorder
C. Postorder
D. In all of the above
Answer: A
3.
For which of the following tree traversal algorithm do not
requires a stack.
A. Inorder
B. Postorder
C. Depth First Search
D. Breadth First Search
Answer: D
4.
Node which is having non-zero degree called as _______.
Augest 2019 – December 2019 1
, Tree And Graph
A. Zero Degree Node
B. Leaf node
C. Root Node
D. Null Node
Answer: B
5.
Binary tree in which all leaf nodes are at same level and
has exactly two children is called as _____________.
A. Perfect Binary Tree
B. Complete Binary Tree
C. Strictly Binary Tree
D. All of the above
Answer: A
6.
Binary Tree with minimum possible height is called as ___.
A. Shortest Binary Tree
B. Min Height Tree
C. Balanced Binary Search Tree
D. None of the above
Answer: C
7.
In a Binary Search Tree searching operation takes ___time.
A. O(1)
B. O(n)
C. O(log n)
D. O(n log n)
Answer: C
Augest 2019 – December 2019 2