1. What is a splay operation?
2. The following given tree is an example for?
/1725099583-51-2.png "Binary Search Trees(B Tree) mcq question image")
3. The steps for finding post-order traversal are traverse the right subtree, traverse the left subtree or visit the current node.
4. Binary tree sort implemented using a self balancing binary search tree takes O(n log n) time in the worst case but still it is slower than merge sort.
5. What operation does the following diagram depict?
/1725100503-51-7.png "Binary Search Trees(B Tree) mcq question image")
6. What is the possible number of binary trees that can be created with 3 nodes, giving the sequence N, M, L when traversed in post-order.
7. The size value of various nodes in a weight balanced tree are
leaf - zero
internal node - size of it's two children
is this true?
leaf - zero
internal node - size of it's two children
is this true?
8. Why is heap implemented using array representations than tree(linked list) representations though both tree representations and heaps have same complexities?
for binary heap
-insert: O(log n)
-delete min: O(log n)
for a tree
-insert: O(log n)
-delete: O(log n)
Then why go with array representation when both are having same values ?
for binary heap
-insert: O(log n)
-delete min: O(log n)
for a tree
-insert: O(log n)
-delete: O(log n)9. AVL trees are more balanced than Red-black trees.
10. Which algorithm is used in the top tree data structure?
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.