Skip to main content

Red Black Tree Insertion in Java

Red Black Tree is a binary search tree. With extra property with each node having color either RED or BLACK.
It has following properties:
  1. Every node is either RED or BLACK
  2. Root element will have BLACK color.
  3. Every RED node has BLACK children.
  4. Every path from root to leaf will have same number of BLACK nodes.
We have few theorems over RB tree:

Note: Height of RB tree is θ(logn).
Insertion:
Insertion in RB tree is little tricky as compared to BST, we have following cases to insert a node in RB tree:

  1. When tree is null just insert the node and it will be root, color will be BLACK.
  2. To insert an element first find its position:
    1. if key <= node.key then move to left
    2. else move to right
  3. Once we find the correct place to insert, we insert the node with color RED.
  4. But if the parent of the node just inserted has color RED then it will violate 3 property.
  5. So we have to fix this issue. We call it double RED problem, we resolve it using following few cases.
DOUBLE RED PROBLEM:
Few naming conventions used are parent, grandparent and uncle. And these conventions are inspired from real life.

Case 1: When uncle has red color

We will make the changes as shown in the figures:
When node x is in left side of parent and uncle is in right side of grand parent of x, second image is solution:

 When node x is in right side of parent and uncle is in left side of grand parent of x, second image is solution of problem shown in first image:




Note 1: After solving the problem it could happen that at new X double red problem could occur, so we will call our function at new X again.
Note 2: Triangles shown under X are null nodes and when problem propagates they could be trees also. But under Uncle the triangles could be null nodes or trees.

 Case 2: When uncle has black color (Zig-Zag Rotation)

When x is in right side of its parent and uncle is in right side of x's grandparent.
After Zig-Zag Rotation



 When x is in left side of its parent and uncle is in left side of x's grandparent.
After Zig-Zag Rotation

Case 3: When uncle and sibling both have black color (Zig-Zig Rotation)
When x is in left side of its parent and uncle is in right side of x's grandparent.

After Zig-Zig Rotation


When x is in right side of its parent and uncle is in left side of x's grandparent.
After Zig-Zig Rotation


Java Code for Insertion:
There are two classes and one interface:
  1. RBTreeFunctions - interface
  2. RBTree - class with functions
  3. RBTreeTest class - testing(Driver) class
Code: click here

Comments

Post a Comment

Popular posts from this blog

Goodness of Fit Test for normal and poisson distribution

Meaning of Goodness of fit test: We find out which distribution fits the sample data the most. And this is achieved using chi-square distribution (Snedecor and Cochran, 1989). How to apply: There are 4 steps to follow: State the hypothesis:  Data follows a distribution or not Criteria to reject null hypothesis: if Χ 2  > Χ 2 (k,1-α) then reject null hypothesis. Analyze sample data: Compute the chi-square value using below formula: ∑(Oi- Ei) 2 /Ei        : Oi is observed frequency and Ei is expected frequency Interpret the results: Declare the results after comparing the values of Χ 2 and Χ 2 (k,1-α), where k is degree of freedom and  α is significance level. Degree of Freedom: It is  =  n - 1 - m m: number of parameter in the distribution. So in case of normal distribution m is 2 ( μ ,α) and in case of poisson dist. m is = 1 ( λ). Example 1: Goodness of fit test for Normal Distribution Year wise d...
2 comments
Read more

classification of database indexing

Dense Index: For every records we are having one entry in the index file. Sparse Index: Only one record for each block we will have it in the index file. Primary Index ( Primary Key + Ordered Data )  A primary index is an ordered file whose records are fixed length size with 2 fields. First field is same as primary key and the second field is pointer to the data block.  Here index entry is created for first record of each block, called ‘block anchor’. Number of index entries thus are equal to number of blocks Average number of block accesses are = logB (worst case) + 1 (best case),  So on average it will be O(logB) The type of index is called sparse index because index is not created for all the records, only the first records of every block the entry is made into the index file. Example on Primary Index Number of Records = 30000, Block Size = 1024 Bytes, Strategy = Unspanned, Record Size = 100 Bytes, Key Size = 6 Bytes, Pointer Size = 9 Byt...
2 comments
Read more