Tree in Data Structure (MCQ - PART-1) by Prateek Jain

Tree in Data Structure (MCQ) by Prateek Jain
Your Doubts will be discussed here.

Full Course is available at :
www.PrateekJainAcademy.com
9555031137

Which of the following is not an advantage of trees?
A. Hierarchical structure
B. Faster search
C. Router algorithms
D. Undo/Redo operations in a notepad

If the tree is not a complete binary tree then what changes can be made for easy access of children of a node in the array ?

A. every node stores data saying which of its children exist in the array
B. no need of any changes continue with 2w and 2w+1, if node is at w
C. keep a seperate table telling children of a node
D. use another array parallel to the array with tree

What is the time complexity of level order traversal?
A. O(1)
B. O(n)
C. O(logn)
D. O(nlogn)

What are double and single threaded trees?
A. when both left, right nodes are having null pointers and only right node is null pointer respectively
B. having 2 and 1 node
C. using single and double linked lists
D. using heaps and priority queues

The no of external nodes in a full binary tree with n internal nodes is?

a) n
b) n+1
c) 2n
d) 2n + 1