Binary Search Trees(B Tree) MCQ question and answer with solution

Section 1 Section 2 Section 3

21.
Which of the following trees is similar to that of an AA-Tree?

A. Splay Tree

B. B+ Tree

C. AVL Tree

D. Red-Black Tree

Answer & Solution Discuss in Board Save for Later

22.

What must be the missing logic below so as to print mirror of a tree as below as an example?

Binary Search Trees(B Tree) mcq question image

if(rootnode):
  mirror(rootnode-->left)
  mirror(rootnode-->right)
 
  //missing
 
end

A. swapping of left and right nodes is missing

B. swapping of left with root nodes is missing

C. swapping of right with root nodes is missing

D. nothing is missing

Answer & Solution Discuss in Board Save for Later

23.
What is the maximum number of children that a binary tree node can have?

A. 0

B. 1

C. 2

D. 3

Answer & Solution Discuss in Board Save for Later

24.
Is partitioning method used by Tango Tree.

A. True

B. False

Answer & Solution Discuss in Board Save for Later

25.
For the tree below, write the pre-order traversal.

A. 2, 7, 2, 6, 5, 11, 5, 9, 4

B. 2, 7, 5, 2, 6, 9, 5, 11, 4

C. 2, 5, 11, 6, 7, 4, 9, 5, 2

D. 2, 7, 5, 6, 11, 2, 5, 4, 9

Answer & Solution Discuss in Board Save for Later

26.
What is the time complexity for creating a new node and then performing concatenation in the rope data structure?

A. O (log n)

B. O (n!)

C. O (n²)

D. O (1)

Answer & Solution Discuss in Board Save for Later

27.
What is the time complexity of level order traversal?

A. O(1)

B. O(n)

C. O(logn)

D. O(nlogn)

Answer & Solution Discuss in Board Save for Later

28.
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 i

C. keep a seperate table telling children of a node

D. use another array parallel to the array with tree

Answer & Solution Discuss in Board Save for Later

29.
Self - balancing binary search trees have a much better average-case time complexity than hash tables.

A. True

B. False

Answer & Solution Discuss in Board Save for Later

30.
What are null nodes filled with in a threaded binary tree?

A. inorder predecessor for left node and inorder successor for right node information

B. right node with inorder predecessor and left node with inorder successor information

C. they remain null

D. some other values randomly

Answer & Solution Discuss in Board Save for Later

1 2 3 4 5 6 7 8 9 10

21.
Which of the following trees is similar to that of an AA-Tree?

Answer & Solution

22.
What must be the missing logic below so as to print mirror of a tree as below as an example?

`if(rootnode): mirror(rootnode-->left) mirror(rootnode-->right) //missing end`

Answer & Solution

23.
What is the maximum number of children that a binary tree node can have?

Answer & Solution

24.
Is partitioning method used by Tango Tree.

Answer & Solution

25.
For the tree below, write the pre-order traversal.

Answer & Solution

26.
What is the time complexity for creating a new node and then performing concatenation in the rope data structure?

Answer & Solution

27.
What is the time complexity of level order traversal?

Answer & Solution

28.
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?

Answer & Solution

29.
Self - balancing binary search trees have a much better average-case time complexity than hash tables.

Answer & Solution

30.
What are null nodes filled with in a threaded binary tree?

Answer & Solution

Read More Section(Binary Search Trees(B Tree))

Binary Search Trees(B Tree) MCQ question and answer with solution | Data Structure MCQs

21. Which of the following trees is similar to that of an AA-Tree?

Answer & Solution

22. What must be the missing logic below so as to print mirror of a tree as below as an example? if(rootnode): mirror(rootnode-->left) mirror(rootnode-->right) //missing end

Answer & Solution

23. What is the maximum number of children that a binary tree node can have?

Answer & Solution

24. Is partitioning method used by Tango Tree.

Answer & Solution

25. For the tree below, write the pre-order traversal.

Answer & Solution

26. What is the time complexity for creating a new node and then performing concatenation in the rope data structure?

Answer & Solution

27. What is the time complexity of level order traversal?

Answer & Solution

28. 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?

Answer & Solution

29. Self - balancing binary search trees have a much better average-case time complexity than hash tables.

Answer & Solution

30. What are null nodes filled with in a threaded binary tree?

Answer & Solution

Read More Section(Binary Search Trees(B Tree))

21.
Which of the following trees is similar to that of an AA-Tree?

22.
What must be the missing logic below so as to print mirror of a tree as below as an example?

`if(rootnode): mirror(rootnode-->left) mirror(rootnode-->right) //missing end`

23.
What is the maximum number of children that a binary tree node can have?

24.
Is partitioning method used by Tango Tree.

25.
For the tree below, write the pre-order traversal.

26.
What is the time complexity for creating a new node and then performing concatenation in the rope data structure?

27.
What is the time complexity of level order traversal?

28.
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?

29.
Self - balancing binary search trees have a much better average-case time complexity than hash tables.

30.
What are null nodes filled with in a threaded binary tree?