leetcode-tree
文章平均质量分 69
shanshanhi
这个作者很懒,什么都没留下…
展开
-
110. Balanced Binary Tree
110. Balanced Binary TreeGiven 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 s原创 2017-01-09 15:08:33 · 273 阅读 · 0 评论 -
173. Binary Search Tree Iterator---这是一个类的设计题值得好好推敲
Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.Calling next() will return the next smallest number in the BST.Note: next() and hasN转载 2017-01-12 21:58:21 · 329 阅读 · 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. After a tour,转载 2017-01-17 19:14:12 · 188 阅读 · 0 评论 -
114. 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 should look like: 1 \ 2 \ 3转载 2017-01-17 20:08:41 · 193 阅读 · 0 评论 -
构建二叉树(前中序构建105,中后序构建106)--非递归的方法值得研究
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.原创 2017-01-13 10:52:29 · 338 阅读 · 0 评论 -
95. Unique Binary Search Trees II--需要细看
Given an integer n, generate all structurally unique BST’s (binary search trees) that store values 1…n.For example, Given n = 3, your program should return all 5 unique BST’s shown below.1 3原创 2017-01-18 13:02:34 · 269 阅读 · 0 评论 -
450. Delete Node in a BST--非递归的写法可以思考
Given a root node reference of a BST and a key, delete the node with the given key in the BST. Return the root node reference (possibly updated) of the BST.Basically, the deletion can be divided into t原创 2017-01-17 18:29:32 · 481 阅读 · 0 评论 -
二叉树(二叉搜索树)上的两节点的公共祖先节点(235和236)
一、二叉搜索树上的两节点的公共祖先 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 defini原创 2017-01-15 00:07:43 · 537 阅读 · 0 评论 -
104. Maximum Depth of Binary Tree
104. Maximum Depth of Binary TreeGiven a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf no原创 2017-01-09 14:31:33 · 342 阅读 · 0 评论 -
437. Path Sum III
You are given a binary tree in which each node contains an integer value.Find the number of paths that sum to a given value.The path does not need to start or end at the root or a leaf, but it转载 2017-01-09 22:43:37 · 332 阅读 · 0 评论 -
404. Sum of Left Leaves
Sum of Left Leaves Find the sum of all left leaves in a given binary tree Example:3 / \ 9 20 / \ 15 7There are two left leaves in the binary tree, with values 9 and 15 respectively. Return原创 2017-01-12 16:08:13 · 332 阅读 · 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’s key. The right原创 2017-01-18 13:33:39 · 358 阅读 · 0 评论 -
226. Invert Binary Tree
226. Invert Binary TreeInvert a binary tree. 4 / \ 2 7 / \ / \1 3 6 9to 4 / \ 7 2 / \ / \9 6 3 1Trivia:This problem was inspired by原创 2017-01-10 14:42:29 · 280 阅读 · 0 评论 -
100. Same Tree和判断一个树是不是对称的思想一样
Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical and the nodes have the same value.Subscribe to see wh原创 2017-01-12 16:49:09 · 315 阅读 · 0 评论 -
101. Symmetric Tree
Symmetric Tree Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree [1,2,2,3,4,4,3] is symmetric:1 / \ 2 2 / \ / \ 3 4 4原创 2017-01-12 13:50:04 · 255 阅读 · 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 \ 5 All root-to-leaf paths are:[“1->2->5”, “1->3”] Credits: Special thanks t原创 2017-01-15 22:35:05 · 449 阅读 · 0 评论 -
102. Binary Tree Level Order Traversal
102. Binary Tree Level Order TraversalGiven 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原创 2017-01-09 17:28:40 · 298 阅读 · 0 评论 -
(待思考--不采用逆置等的思想)107. Binary Tree Level Order Traversal II
107. Binary Tree Level Order Traversal IIGiven 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).Fo原创 2017-01-09 18:03:58 · 286 阅读 · 0 评论 -
(待研究)111. Minimum Depth of Binary Tree
111. Minimum Depth of Binary TreeGiven a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf转载 2017-01-09 16:13:09 · 298 阅读 · 0 评论 -
199. Binary Tree Right Side View(递归代码想不明白)
Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.For example: Given the following binary tree, 1原创 2017-01-13 14:25:00 · 416 阅读 · 0 评论 -
(非递归的方法待研究)112. Path Sum
112. Path SumGiven 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 bel原创 2017-01-09 22:08:47 · 595 阅读 · 0 评论 -
113. Path Sum II
113. Path Sum IIGiven a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.For example:Given the below binary tree and sum = 22,原创 2017-01-09 22:21:20 · 297 阅读 · 0 评论 -
二叉树的几种遍历的方法(后序遍历的另外一种递归实现还需要思考)
1、先序遍历:94. Binary Tree Inorder TraversalGiven a binary tree, return the inorder traversal of its nodes' values.For example:Given binary tree [1,null,2,3], 1 \ 2 / 3原创 2017-01-10 16:57:05 · 526 阅读 · 0 评论 -
230. Kth Smallest Element in a BST
Given a binary search tree, write a function kthSmallest to find the kth smallest element in it.Note: You may assume k is always valid, 1 ≤ k ≤ BST’s total elements.Follow up: What if the BST is mod原创 2017-01-14 12:15:46 · 202 阅读 · 0 评论 -
116. Populating Next Right Pointers in Each Node
Given a binary treestruct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next;}Populate each next pointer to point to its next right node. If there is no next right node,原创 2017-01-14 12:41:25 · 235 阅读 · 0 评论 -
117. Populating Next Right Pointers in Each Node II
Follow up for problem “Populating Next Right Pointers in Each Node”.What if the given tree could be any binary tree? Would your previous solution still work?Note:You may only use constant extra space.原创 2017-01-14 13:13:04 · 206 阅读 · 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 1 \ /转载 2017-01-15 20:05:00 · 234 阅读 · 0 评论 -
95. Unique Binary Search Trees II--还未做
Given an integer n, generate all structurally unique BST’s (binary search trees) that store values 1…n.For example, Given n = 3, your program should return all 5 unique BST’s shown below.1 3转载 2017-01-15 20:17:58 · 302 阅读 · 0 评论 -
129. Sum Root to Leaf Numbers--注意非递归的方法
Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.An example is the root-to-leaf path 1->2->3 which represents the number 123.Find the total sum of al原创 2017-01-15 21:54:42 · 271 阅读 · 0 评论 -
108. Convert Sorted Array to Binary Search Tree(和把一个单链表转换成BST树的思想一致)
Given an array where elements are sorted in ascending order, convert it to a height balanced BST.Subscribe to see which companies asked this question 解题思路:利用递归思想去解决,首先找到有序数组的中位数节点,即位于最中间位置的节点作为根节点,然后依原创 2017-01-13 09:54:42 · 383 阅读 · 0 评论