Chat component library — demo

Binary Search Trees

Here's a plan:

1. Definition — ordered nodes, left < parent < right
2. Operations — insert, search, delete
3. Complexity — O(log n) balanced, O(n) worst case

function insert(node, value) {  if (!node) return { value, left: null, right: null };  if (value < node.value) node.left = insert(node.left, value);  else node.right = insert(node.right, value);  return node;}

Want a practice problem next?

Working on it…