2.6. Binary Search Tree

The definition of binary search tree (BST) can be slightly different in different context. Sometimes, it requires parent strictly greater than any node in left subtree, and other times the parent node can be equal to the max node in the left subtree.

Figure 2.6.1 A Binary Search Tree

• 2.6.1. General Binary Search Tree
  • 2.6.1.1. Validate Binary Search Tree
  • 2.6.1.2. Minimum Distance Between BST Nodes
  • 2.6.1.3. Inorder Successor in BST
  • 2.6.1.4. Median Binary Tree
• 2.6.2. Map and Set
  • 2.6.2.1. Entity Spotter
  • 2.6.2.2. Dynamic Bounding Box
• 2.6.3. Questions
  • 2.6.3.1. Stock Price Fluctuation