Question 51 : How many child nodes does each node of Ternary Tree contain?
1. 4
2. 6
3. 5
4. 3
View Answer   Discuss with Members

Question 52 : Which of the following is the simplest data structure that supports range searching?
1. Heaps
2. binary search trees
3. AA-trees
4. K-d trees
View Answer   Discuss with Members

Question 53 : Can operation like Find Next and Find Previous be implemented.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 54 : What is the Height of the root node of K-ary tree?
1. 1
2. 2
3. 3
4. 0
View Answer   Discuss with Members

Question 55 : In a k-d tree, k originally meant?
1. number of dimensions
2. size of tree
3. length of node
4. weight of node
View Answer   Discuss with Members

Question 56 : How many strategies are followed to solve a dynamic equivalence problem?
1. 1
2. 2
3. 3
4. 4
View Answer   Discuss with Members

Question 57 : What is the depth of the root node of K-ary tree?
1. 2
2. 1
3. 0
4. 3
View Answer   Discuss with Members

Question 58 : What is the height of a K-ary tree having only root node?
1. 1
2. 0
3. 2
4. 3
View Answer   Discuss with Members

Question 59 : ___________ is one of the earliest forms of a self-adjustment strategy used in splay trees, skew heaps.
1. Union by rank
2. Equivalence function
3. Dynamic function
4. Path compression
View Answer   Discuss with Members

Question 60 : What is the time complexity for searching a key or integer in Van Emde Boas data structure?
1. O (log M!)
2. O (M!)
3. O (M²)
4. O (log (log M))
View Answer   Discuss with Members