Unit 2: Previous Year Question

Q1. Give the properties of Red – Black Tree. Show that the longest simple path from a node x in a
RB-Tree to a descendent leaf has length at most twice that of shortest simple path from
node x to a descendent leaf.
Q2. Show the result of inserting the following items in a initially empty B Tree of order 5.

Order M means at least ceil( m/2) children (ie at least ceil(m/2)-1 keys),
at most m children (m-1 keys)

25, 31, 38, 76, 05, 60, 38, 08, 30, 15, 35, 17, 23, 53, 27, 43, 65, 48.
Q3. Write an algorithm HEAP-DELETE(A,i), which delete the item in node I from heap A.
Q4. What do you understand by binomial heap? How to merge two BINOMIAL HEAP?
Q5. What is RB Tree ? Explain its properties.
Q6. Write an algorithm to perform insertion in B-tree.
Q7. Write an algorithm for inserting a node into Fibonacci Heap.
Q8. Explain deletion procedure into a B Tree.
Q9. What is binomial tree? Explain with suitable example. You are also required to give its
properties
Q10. What are three different cases,When insert a node into a Red Black Tree (RBT)? Explain with
eg.
Q11. Explain the different conditions of getting union of two existing binomial heaps.
Q12. What are the various differences in Binomial and Fibonacci Heap? Explain.
Q13. Write an algorithm of insertion in B tree. You are also required to give comments on its
running time.
Q14. Write an algorithm for inserting a key into a B Tree in a single pass down the tree.
Q15. Prove that the maximum degree of any node in a n node binomial tree is lg n.
Q16. Show that if only the merge able heap operations and supported, the maximum degree D(n)
in an n-node Fibonacci Heap is at most Log n.
Q17. Show that a Red Black Tree with n internal nodes has height at most 2lg(n+1).
Q18. Argue that in every n- node binary search tree thre are exactly n-1 possible rotations.
Q19. Consruct the binary expression tree from the following traversals
i. Inorder: 4+3+2*1
ii. Preorder:+4*+3 2 1
Q20. Give an algorithm to count the number of leaf nodes in a binary tree T. What it’s Computing
time?