2015年10月25日
LeetCode OJ：Flatten Binary Tree to Linked List（捋平二叉树）
摘要： Given a binary tree, flatten it to a linked list in-place.For example,Given 1 / \ 2 5 / \ \ 3 4 6The flattened tree... 阅读全文
posted @ 2015-10-25 22:05 eversliver 阅读(305) 评论(0) 推荐(0)
LeetCode OJ：Convert Sorted Array to Binary Search Tree（将排序好的数组转换成二叉搜索树）
摘要： Given an array where elements are sorted in ascending order, convert it to a height balanced BST.讲一个排序好的数组转换成二叉搜索树，这题没想出来，基本上是参考别人的，边界条件应该注意一下： 1 /** ... 阅读全文
posted @ 2015-10-25 21:19 eversliver 阅读(369) 评论(0) 推荐(0)
LeetCode OJ：Count Complete Tree Nodes（完全二叉树的节点数目）
摘要： Given acompletebinary tree, count the number of nodes.Definition of a complete binary tree fromWikipedia:In a complete binary tree every level, except... 阅读全文
posted @ 2015-10-25 14:47 eversliver 阅读(255) 评论(0) 推荐(0)
LeetCode OJ：Validate Binary Search Tree（合法的二叉搜索树）
摘要： Given a binary tree, determine if it is a valid binary search tree (BST). Assume a BST is defined as follows: The left subtree of a node contains only 阅读全文
posted @ 2015-10-25 14:04 eversliver 阅读(395) 评论(0) 推荐(0)
LeetCode OJ：Kth Smallest Element in a BST（二叉树中第k个最小的元素）
摘要： Given a binary search tree, write a functionkthSmallestto find thekth smallest element in it.Note:You may assume k is always valid, 1 ≤ k ≤ BST's tota... 阅读全文
posted @ 2015-10-25 12:35 eversliver 阅读(443) 评论(0) 推荐(0)