Tree Method: Binary Search Tree

• the search tree is organized so that

  
  
  p.left NIL ? p.left.x < p.x
  p.right NIL ? p.x < p.right.x
  

• minimum node value - traverse the left links, starting at the root until a leaf is found

Previous slide

Next slide

Back to first slide

View graphic version