Trees

A tree is a branching structure of nodes with children. A binary search tree gives each node up to two children and keeps order: smaller values go left, larger values go right. That ordering makes lookups fast — you halve the search at each step.

class TreeNode {
  constructor(value) { this.value = value; this.left = null; this.right = null }
}