TreesHeaps
| CI status | Coverage |
|---|---|
 |
 |
Implementation of various tree and heaps (to do) structures. Only binary search tree, AVL tree, splay tree are supported now. Available operations includes search, insert!, topdowninsert!, delete!, topdowndelete!, splay!, topdownsplay!, findmin, findmax. Outputs are formatted through AbstractTrees.jl. Other structures and plotting recipe are under developments!
TO DO
- Red-black tree
- 2-4 tree
- AA tree
- 2-3 tree
- Heaps
- Plotting recipe