Binary Tree
文章平均质量分 79
cuihaolong
这个作者很懒,什么都没留下…
展开
-
235. Lowest Common Ancestor of a Binary Search Tree
题目Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.According to the definition of LCA on Wikipedia: “The lowest common ancestor is define原创 2016-03-28 10:00:15 · 270 阅读 · 0 评论 -
105. Construct Binary Tree from Preorder and Inorder Traversal
题目Given preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.For example, givenpreorder = [3,9,20,15,7]in原创 2018-04-24 11:14:54 · 296 阅读 · 0 评论 -
98. 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 nodes with keys less than the node'原创 2018-04-23 12:06:09 · 307 阅读 · 0 评论 -
96. Unique Binary Search Trees
题目Given n, how many structurally unique BST's (binary search trees) that store values 1...n?For example,Given n = 3, there are a total of 5 unique BST's. 1 3 3 2原创 2018-04-03 10:42:52 · 219 阅读 · 0 评论 -
513. Find Bottom Left Tree Value
题目Given a binary tree, find the leftmost value in the last row of the tree.Example 1:Input: 2 / \ 1 3Output:1Example 2: Input: 1 / \ 2原创 2017-03-02 19:13:42 · 254 阅读 · 0 评论 -
515. Find Largest Value in Each Tree Row
题目You need to find the largest value in each row of a binary tree.Example:Input: 1 / \ 3 2 / \ \ 5 3 9 Output: [1, 3, 9]分析递归遍历树,原创 2017-03-06 09:33:45 · 828 阅读 · 0 评论 -
108. Convert Sorted Array to Binary Search Tree
题目Given an array where elements are sorted in ascending order, convert it to a height balanced BST.分析对给定的数组进行二分检索,检索的过程中构造相应的树结构,由于树的定义只有带参数的构造函数,而没有默认构造函数,所以只能通过返回指针的形式构造树。/** * Definition原创 2016-09-21 16:57:33 · 256 阅读 · 0 评论 -
337. House Robber III
题目The thief has found himself a new place for his thievery again. There is only one entrance to this area, called the "root." Besides the root, each house has one and only one parent house. Afte原创 2016-09-07 14:29:27 · 267 阅读 · 0 评论 -
94. Binary Tree Inorder Traversal
题目Given a binary tree, return the inorder traversal of its nodes' values.For example:Given binary tree [1,null,2,3], 1 \ 2 / 3return [1,3,2].Note: Recurs原创 2016-08-31 11:14:30 · 198 阅读 · 0 评论 -
257. Binary Tree Paths
题目Given a binary tree, return all root-to-leaf paths.For example, given the following binary tree: 1 / \2 3 \ 5All root-to-leaf paths are:["1->2->5", "1->3"]分原创 2016-04-21 19:47:30 · 210 阅读 · 0 评论 -
112. Path Sum
题目Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.For example:Given the below binary tree原创 2016-04-08 21:28:40 · 243 阅读 · 0 评论 -
102. Binary Tree Level Order Traversal
题目Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree {3,9,20,#,#,15,7}, 3 / \ 9原创 2016-04-08 15:32:32 · 195 阅读 · 0 评论 -
107. Binary Tree Level Order Traversal II
题目Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).For example:Given binary tree {3,9,20,#,#原创 2016-04-05 09:56:58 · 232 阅读 · 0 评论 -
101. Symmetric Tree
题目Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: 1 / \ 2 2 / \ / \3 4 4 3B原创 2016-04-04 14:26:26 · 226 阅读 · 0 评论 -
110. Balanced Binary Tree
题目Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node nev原创 2016-04-04 14:03:10 · 225 阅读 · 0 评论 -
114. Flatten Binary Tree to Linked List
题目Given a binary tree, flatten it to a linked list in-place.For example, given the following tree: 1 / \ 2 5 / \ \3 4 6The flattened tree should look like:1 \ 2原创 2018-04-25 14:52:28 · 259 阅读 · 0 评论