Tree (Binary, AVL, Red Black)

It is a implementation of Tree (Binary, AVL and Red Black) and the various operations (Insertion, Deletion) and traversal Inorder, Postorder and Preorder. Study the code in the order binary .. AVL .. Red Black to understand how the program enhances and works.. The various factors such as Balancing factor, height and colour fixup have been kept in mind. Each rotation in Tree is clearly depicted and coded as a separate function.