2017年5月12日
[LintCode] 378 Convert Binary Search Tree to Doubly Linked List 解题报告
摘要： DescriptionConvert a binary search tree to doubly linked list with in-order traversal.ExampleGiven a binary search tree: 4 / \ 2 5 / \1 3return 1<->2< 阅读全文
posted @ 2017-05-12 09:16 panini 阅读(1033) 评论(0) 推荐(0) 编辑
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. Note: If the given node has no in-order successo 阅读全文
posted @ 2017-05-12 08:02 panini 阅读(137) 评论(0) 推荐(0) 编辑