4.6 Write an algorithm to find the‘next‘node (i.e., in-order successor) of a given node in a binary search tree. You may assume that each node has a link to its parent.
[CareerCup] 4.6 Find Next Node in a BST 寻找二叉搜索树中下一个节点
原文：http://www.cnblogs.com/grandyang/p/4709487.html