Posts tagged with “binary trees”

Splay Trees: The Pretty Much Perfect Binary Search Tree

Splay Trees: The Pretty Much Perfect Binary Search Tree

Splay trees are very simple as far as structure. A splay tree a binary search tree, so each node has a key, maybe a left child, and maybe a right child. There’s no subtree height, ranking info, or anything else. It’s pretty simple. It’s the splay algorithm that gives the splay…

Read more
Binary Trees

Binary Trees

I’ve moved on to trees, and I have many trees to cover. The types of trees I’m studying: binary search tree: BST red/black tree splay trees AVL trees B-Trees: 2-3 (type of B-tree) Search Trees N-ary trees Tries Heap Binary Heap Disjoint Sets Priority Queue Here are a few code samples…

Read more