Skip to main content

BST ↔ tree data-struct for fast insert/search

aka Binary-Search-Tree, BST

Treap​

BST with Heap Property to ins/del node

Splay Tree​

BST self-adjust to optimize Time Complexity

References​

  1. Treap ↔ BST with Heap Property to ins/del node

  2. Splay Tree ↔ BST self-adjust to optimize Time Complexity