41. For the tree below, write the level-order traversal.
/1725253295-54-2.png "Binary Search Trees(B Tree) mcq question image")
42. When it would be optimal to prefer Red-black trees over AVL trees?
43. What is the disadvantage of using splay trees?
44. After which city is tango tree named?
45. Is it possible to perform a split operation on a string in the rope if the split point is in the middle of the string.
46. What is the average running time of a treap?
47. What is the time complexity for maintaining a dynamic set of weighted trees?
48. Consider below sequences.
array=60 90 10 100 40 150 90
reverse 2 to 3
array=60 10 90 100 40 150 90
reverse 3 to 6
array= 60 100 150 40 100 90 90
now printout from 1 to 6 :-- 60 100 150 40 100 90
How to achieve the above operation efficiently?
array=60 90 10 100 40 150 90
reverse 2 to 3
array=60 10 90 100 40 150 90
reverse 3 to 6
array= 60 100 150 40 100 90 90
now printout from 1 to 6 :-- 60 100 150 40 100 9049. In the given figure, find '?'.
/1725256668-60-14.png "Binary Search Trees(B Tree) mcq question image")
50. What may be the psuedo code for finding the size of a tree?
Read More Section(Binary Search Trees(B Tree))
Each Section contains maximum 100 MCQs question on Binary Search Trees(B Tree). To get more questions visit other sections.