Binary Search Tree
A standard binary tree where left child < parent < right child. No balancing guarantees.
Search/Insert/Delete: O(h) (worst O(n))
JavaScript
1function insert(node, value) {
2 if (!node) return new Node(value);
3
4 if (value < node.value)
5 node.left = insert(node.left, value);
6 else if (value > node.value)
7 node.right = insert(node.right, value);
8
9 return node;
10}