2017年2月27日
leetcode-501. Find Mode in Binary Search Tree
摘要： Given a binary search tree (BST) with duplicates, find all the mode(s) (the most frequently occurred element) in the given BST. Assume a BST is define 阅读全文
posted @ 2017-02-27 10:14 Pacific-hong 阅读(920) 评论(0) 推荐(0)
leetcode-116. Populating Next Right Pointers in Each Node
摘要： Given a binary tree Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to NULL 阅读全文
posted @ 2017-02-27 00:31 Pacific-hong 阅读(154) 评论(0) 推荐(0)