2016年3月22日
[LeetCode] 285. Inorder Successor in BST 二叉搜索树中的中序后继节点
摘要： Given a binary search tree and a node in it, find the in-order successor of that node in the BST. The successor of a node p is the node with the small 阅读全文
posted @ 2016-03-22 13:49 Grandyang 阅读(20493) 评论(9) 推荐(0)
Fork me on GitHub