Top 80+ Solved Non Linear Data Structures - Trees MCQ Questions Answer

a. Level-order traversal

b. Pre-order traversal

c. Post-order traversal

d. In-order traversal

a. Height

b. Depth

c. Length

d. Width

a. Height

b. Depth

c. Length

d. Width

a. Each node has exactly zero or two children

b. Each node has exactly two children

c. All the leaves are at the same level

d. Each node has exactly one or two children

a. Each node has exactly zero or two children

b. A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from right to left

c. A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from left to right

d. A tree In which all nodes have degree 2

a. h = O(loglogn)

b. h = O(nlogn)

c. h = O(n)

d. h = O(log n)

a. Hierarchical structure

b. Faster search

c. Router algorithms

d. Undo/Redo operations in a notepad

a. L = 2*I

b. L = I + 1

c. L = I – 1

d. L = 2*I – 1

a. N = 2*I

b. N = I + 1

c. N = I – 1

d. N = 2*I + 1

a. N = 2*L

b. N = L + 1

c. N = L – 1

d. N = 2*L – 1

a. The left child is always lesser than its parent

b. The right child is always greater than its parent

c. The left and right sub-trees should also be binary search trees

d. In order sequence gives decreasing order of elements

a. It traverses in a non increasing order

b. It traverses in an increasing order

c. It traverses in a random fashion

d. It traverses based on priority of the node

a. O(n), O(n)

b. O(logn), O(logn)

c. O(logn), O(n)

d. O(n), O(logn)

a. The tree should not be modified and you should know how often the keys are accessed, it improves the lookup cost

b. You should know the frequency of access of the keys, improves the lookup time

c. The tree can be modified and you should know the number of elements in the tree before hand, it improves the deletion time

d. The tree should be just modified and improves the lookup time

a. AVL Tree

b. 2-3-4 Tree

c. Red – Black Tree

d. Splay Tree