As soon as we started programming, we found to our surprise that it wasn’t as easy to get programs right as we had thought. Debugging had to be discovered. I can remember the exact instant when I realized that a large part of my life from then on was going to be spent in finding mistakes in my own programs. Maurice Wilkes

Red-Black tree

Language Java | Level Intermediate | Category Algorithms | August 2, 2015 6:49 pm


Algorithm Problem Description

Red Black tree is self-balanced binary search tree with color information. The Red-Black tree nodes can be either red or black. The color ensures tree balance. The root node and all leaves node set with black color. When inserting new item in the red-black tree, the tree balanced based on these properties. The search operation similar to the binary search tree.

Output

          	        
          	        Insert values to Red Black Tree.
Print items from Red Black Tree: 11
23
50
67
99

Find element 11 in the Red black tree
          	        
          	        				    


Comments



Please login to add comments.