Data-Structures Important questions - IInd Internals

1. Binary tree rotaions..
single left rotation - single right rotation - double left rotation - double right rotation

2. Infix to postfix
(p+q)*r/(s-t)

3.Insertion/deletion in binary heap

4.B - TREE insertion- 22,18,7,61,52,34,1,8,11,9,23,31,41

5.Explain in detail about Splay tree

6.Insertion /Deletion /find maximum /find minimum - of elements in a binary search tree

7.Insertion of following numbers in binary search tree : 2,1,4,5,9,3,6,7

8.In-order, pre-order, post-order Traversals..
creation of binary search tree using the above methods

9.Threaded BInary Tree

All the best people

also see avl tree routines ..

**** it...

i left my data structures class work in my bus itself !!!!

iduku dan bus la lam padika kudadadu nu solradhu...!!!!!

podi pakki... enakku than ennoda peelings theriyum