While inserting a new node in a Binary Search Tree, there are four possibilities:View more random threads:
- what are the relationship between prefix infix and postfix...
- what is main logic behind turning a register into byte...
- what is program in C++ May 2011 ?
- classes use in c++ May 2011
- DEV-C++ equation solver
- How to write Wav files in c++ 2011
- This programme prompts when area of inner circle is greater...
- ASCII code of c++
- Here is a chunk of code prototype of Library Managment...
- calculation k kam to calculator sai bi kar late hai aur age...
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.
Sponsored Links
There are currently 1 users browsing this thread. (0 members and 1 guests)