2015年8月6日
[CareerCup] 4.6 Find Next Node in a BST 寻找二叉搜索树中下一个节点
摘要： 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 l... 阅读全文
posted @ 2015-08-06 23:26 Grandyang 阅读(1191) 评论(0) 推荐(0) 编辑
Fork me on GitHub