Predeccesor

1 min read

In a Binary Search Tree

  • Largest data less than node
  • One step left, then a as far right as possible

Graph View

Backlinks