Data Structure -- 4.2 Binary Search Tree

Binary Search Tree is a special binary tree, where

• left child contains only nodes with value less than the parent node
• right child only contains nodes with values greater than or equal to parent

It's good for searching

This page has many basic insertion/deletion algorithms http://blog.jobbole.com/79305/
IsValidBST is fundamental Lowest Common Ancester is interesting.