This is an implementation of a self-balancing binary tree, using Java 1.8
Static main example:
Input:
n - number of elements to insert into binary tree
0 5 2 7 ... - n elements to be inserted into the tree
Output:
InOrder traversal
PreOrder traversal