Time left:

[All Quizzes] → [Practical Data Structures] → [Trees]


1. ► Tree traversal is a linear operation

A.
B.

2. ► Leaf nodes have no children

A.
B.

3. ► Search in an unbalanced tree always has O(lg(n)) complexity

A.
B.

4. ► Insertion is O(n) operation in a tree

A.
B.

5. ► No node in a binary tree has more than 2 children

A.
B.

6. ► In a tree, all nodes are connected

A.
B.

7. ► STL has no tree container

A.
B.

8. ► In a post-order traversal, root nodes comes at the last

A.
B.

9. ► Node values in a binary search tree are ordered

A.
B.

10. ► Which of the traversals in binary search tree gives sorted list

A.
B.
C.

11. ► Insert and delete in self-balancing trees happen in linear time

A.
B.

12. ► All binary search trees are balanced

A.
B.


© 2016 VirtuQ™ Education All right reserved. | Terms of Use | Privacy Policy