Vlad-Karpov / don.juan.matus

Java binary search trees implementations: avl, red-black, AA tree, scapegoat tree, cartesian tree, splay tree. Bonus: skip list implementation.

don.juan.matus

don.juan.matus repository

package don.juan.matus.lib.collection.sorted.tree.bintree

Binary search tree classes:

• BST (BinTreeBase)
• Weight balanced tree (BinTreeW)
• AVL (AVLBinTree)
• Red Black tree (RedBlackTree)
• AA binary tree - (AATree)
• Scapegoat (ScapegoatTree)
• RandomRotateBinTree (RandomRotateBinTree)
• Randomizing tree (RndBinTree)
• Cartesian tree (CartesianBinTree)
• RandomMergeBinTree (RandomMergeBinTree)
• Splay tree (SplayTree)

Other order collections:

• Skip list (SkipList)

and others...

• Heap based on AVL and Splay trees (AvlSplayHeap)
• Heap based on AVL tree and index by creation node time as AVL tree also (while...)