Blog

写BST树，进行三种遍历，即pre-order traversal, post-order traversal和in-order traversal.