While inserting a new node in a Binary Search Tree, there are four possibilities:View more random threads:
- can we use Microsoft Visual Studio Ultimate 2010 for...
- What is namespace std in c++ 2011?
- how we can store data into a file in C++ and java?
- what is ADT?
- Function also provides encapsulation, what it means with an...
- security and privacy in c
- what is meant by concrete class in c++ 2011?
- Programme Not Run in C++ giving erros 2011
- sir i cant under stand function and cant apply it in...
- speclization in c++ 2011
Sponsored Links
Case I: If new node is inserted in the left subtree of the left child of a, perform single right rotation.
Case II: If new node is inserted in the right subtree of the left child of a. perform left-right double rotation.
Case III: If new node is inserted in the left subtree of the right child of a. perform right-left double rotation.
Case IV: If new node is inserted in the right subtree of the right child of a, perform single left rotation.
There are currently 1 users browsing this thread. (0 members and 1 guests)