Unlike insert where we do a plain check for in-order property to insert elements. That is, we add from left to right. In Binary search tree, deletion is a tricky algorithm and must be understood well to understand self-balancing trees.

BINARY SEARCH TREE :: DELETION (REMOVAL) ALGORITHM (Java, C++) | Algorithms and Data Structures

Binary search trees has a small problem when it comes to insertion and deletions. Heap is balanced by default since we construct it from across with the single property that root is greater than the leaves. But BST property makes it grow either in left or the right side if the insertion of a sorted array is done. Consider the insertion code we already have.

The above array will yield a tree which grows towards the right!!.. So, when we search such a binary tree, we get a worst case time if the tree is too huge!!.. This is where self-balancing trees came into picture. But what does deletion needs to do in a BST, it needs to follow the in-order sorted property.

It also never balances a BST if it is right inclined. But there are proofs that random insertion and deletion gives somewhat balanced BST. Deletion involves three cases. Consider you have given a node for deletion. For any node in a BST, there are 3 cases. Node can have 0, 1 or 2 children. This is explained clearly in many books.

C Program to Construct a Binary Search Tree and perform deletion and inorder traversal - Sanfoundry

So, please refer Cormen to get clear picture. An Algorithm a Day. Thursday, 24 March Binary search tree—Deletion. Concept Deletion involves three cases.

Binary Search tree | Deletion - IDeserve

Posted by Pushparajan V at Share to Twitter Share to Facebook Share to Pinterest. Newer Post Older Post Home. About the site This blog showcases articles which will discuss about algorithms from scratch. And all articles will be readable by Dummies since it is written by Dummies, for the Dummies and dedicated to the Dummies. ITS A BASIC STUDY LOG BLOG. About the Author Pushparajan V. Theme images by luoman.

About the Author Pushparajan V View my complete profile.