searching and updating in dictionary the red-black tree data structure is slightly more complicated than its corresponding ( , tree even soa red-black tree has conceptual advantage that only constant number of trinode restructurings are ever needed to restore the balance in red-black tree after an update java implementation in code fragments through we show the major portions of java implementation of dictionary realized by means of red-black tree the main class includes nested classrbnodeshown in code fragment which extends the btnode class used to represent key-value entry of binary search tree it defines an additional instance variable isredrepresenting the color of the nodeand methods to set and return it code fragment instance variablesnested classand constructor for rbtree