leetcode树
Bryan要加油
这个作者很懒,什么都没留下…
展开
-
1104. Path In Zigzag Labelled Binary Tree[Medium](Leetcode每日一题-2021.07.29)
Problem原创 2021-07-31 22:40:59 · 298 阅读 · 0 评论 -
863. All Nodes Distance K in Binary Tree[Medium](Leetcode每日一题-2021.07.27)
Problem原创 2021-07-31 22:40:01 · 135 阅读 · 0 评论 -
671. Second Minimum Node In a Binary Tree[Easy](Leetcode每日一题-2021.07.27)
ProblemGiven a non-empty special binary tree consisting of nodes with the non-negative value, where each node in this tree has exactly two or zero sub-node. If the node has two sub-nodes, then this node’s value is the smaller value among its two sub-nodes原创 2021-07-27 19:34:53 · 278 阅读 · 0 评论 -
剑指 Offer 37. 序列化二叉树[Hard](Leetcode每日一题-2021.06.30)
Problem请实现两个函数,分别用来序列化和反序列化二叉树。你需要设计一个算法来实现二叉树的序列化与反序列化。这里不限定你的序列 / 反序列化算法执行逻辑,你只需要保证一个二叉树可以被序列化为一个字符串并且将这个字符串反序列化为原始的树结构。Example输入:root = [1,2,3,null,null,4,5]输出:[1,2,3,null,null,4,5]本题与主站 297 题相同:https://leetcode-cn.com/problems/serialize-and-de原创 2021-06-30 08:17:38 · 197 阅读 · 0 评论 -
1600. Throne Inheritance[Medium](Leetcode每日一题-2021.06.20)--抄答案
Problem原创 2021-06-21 22:25:01 · 383 阅读 · 0 评论 -
993. Cousins in Binary Tree[Easy](Leetcode每日一题-2021.05.17)
ProblemIn a binary tree, the root node is at depth 0, and children of each depth k node are at depth k+1.Two nodes of a binary tree are cousins if they have the same depth, but have different parents.We are given the root of a binary tree with unique va原创 2021-05-17 08:42:24 · 125 阅读 · 0 评论 -
872. Leaf-Similar Trees[Easy](Leetcode每日一题-2021.05.10)
ProblemConsider all the leaves of a binary tree, from left to right order, the values of those leaves form a leaf value sequence.For example, in the given tree above, the leaf value sequence is (6, 7, 4, 9, 8).Two binary trees are considered leaf-simil原创 2021-05-10 08:13:20 · 228 阅读 · 0 评论 -
938. Range Sum of BST(Leetcode每日一题-2021.04.27)
ProblemGiven the root node of a binary search tree, return the sum of values of all nodes with a value in the range [low, high].Constraints:The number of nodes in the tree is in the range [1, 2 * 10^4].1 <= Node.val <= 10^51 <= low <= hig原创 2021-04-27 17:02:34 · 205 阅读 · 0 评论 -
897. Increasing Order Search Tree(Leetcode每日一题-2021.04.25)
ProblemGiven the root of a binary search tree, rearrange the tree in in-order so that the leftmost node in the tree is now the root of the tree, and every node has no left child and only one right child.Constraints:The number of nodes in the given tree原创 2021-04-25 21:43:41 · 178 阅读 · 0 评论 -
783. Minimum Distance Between BST Nodes(Leetcode每日一题-2021.04.13)
ProblemGiven the root of a Binary Search Tree (BST), return the minimum difference between the values of any two different nodes in the tree.Note: This question is the same as 530: https://leetcode.com/problems/minimum-absolute-difference-in-bst/Constra原创 2021-04-13 08:34:39 · 456 阅读 · 0 评论 -
173. Binary Search Tree Iterator(Leetcode每日一题-2021.03.28)--抄答案
ProblemImplement the BSTIterator class that represents an iterator over the in-order traversal of a binary search tree (BST):BSTIterator(TreeNode root) Initializes an object of the BSTIterator class. The root of the BST is given as part of the construct原创 2021-03-29 21:43:33 · 259 阅读 · 0 评论 -
222. Count Complete Tree Nodes(Leetcode每日一题-2020.11.24)
ProblemGiven a complete binary tree, count the number of nodes.Note:Definition of a complete binary tree from Wikipedia:In a complete binary tree every level, except possibly the last, is completely filled, and all nodes in the last level are as far le原创 2020-11-24 09:45:22 · 205 阅读 · 0 评论 -
129. Sum Root to Leaf Numbers(Leetcode每日一题-2020.10.29)
ProblemGiven 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 all root-to-leaf numbers.Note: A leaf is原创 2020-10-29 21:37:27 · 123 阅读 · 0 评论 -
144. Binary Tree Preorder Traversal(Leetcode每日一题-2020.10.27)
ProblemGiven the root of a binary tree, return the preorder traversal of its nodes’ values.Example1Input: root = [1,null,2,3]Output: [1,2,3]Example2Input: root = []Output: []Example3Input: root = [1]Output: [1]Example4Input: root = [1,原创 2020-10-27 21:27:21 · 167 阅读 · 0 评论 -
116. Populating Next Right Pointers in Each Node(Leetcode每日一题-2020.10.15)
ProblemYou are given a perfect binary tree where all leaves are on the same level, and every parent has two children. The binary tree has the following definition:struct Node {int val;Node *left;Node *right;Node *next;}Populate each next pointer原创 2020-10-15 21:49:00 · 460 阅读 · 0 评论 -
530. Minimum Absolute Difference in BST&783. Minimum Distance... (Leetcode每日一题-2020.10.12)
ProblemGiven a binary search tree with non-negative values, find the minimum absolute difference between values of any two nodes.Note:There are at least two nodes in this BST.ExampleSolution/** * Definition for a binary tree node. * struct TreeNode原创 2020-10-12 19:57:38 · 181 阅读 · 0 评论 -
701. Insert into a Binary Search Tree(Leetcode每日一题-2020.09.30)
ProblemYou are given the root node of a binary search tree (BST) and a value to insert into the tree. Return the root node of the BST after the insertion. It is guaranteed that the new value does not exist in the original BST.Notice that there may exist原创 2020-10-07 21:34:53 · 404 阅读 · 0 评论 -
145. Binary Tree Postorder Traversal(Leetcode每日一题-2020.09.29)
ProblemGiven the root of a binary tree, return the postorder traversal of its nodes’ values.Constraints:The number of the nodes in the tree is in the range [0, 100].100 <= Node.val <= 100Example1Input: root = [1,null,2,3]Output: [3,2,1]E原创 2020-10-06 20:25:42 · 215 阅读 · 0 评论 -
117. Populating Next Right Pointers in Each Node II(Leetcode每日一题-2020.09.28)
占坑原创 2020-09-28 10:39:53 · 313 阅读 · 0 评论 -
235. Lowest Common Ancestor of a Binary Search Tree(Leetcode每日一题-2020.09.27)
占坑原创 2020-09-28 10:39:19 · 519 阅读 · 1 评论 -
106. Construct Binary Tree from Inorder and Postorder Traversal(Leetcode每日一题-2020.09.25)
ProblemGiven inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.ExampleFor example, giveninorder = [9,3,15,20,7]postorder = [9,15,7,20,3]Return the following binary tr原创 2020-09-25 20:26:53 · 171 阅读 · 0 评论 -
501. Find Mode in Binary Search Tree(Leetcode每日一题-2020.09.24)
ProblemGiven 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 defined as follows:The left subtree of a node contains only nodes with keys less than or equal to the原创 2020-09-24 21:32:21 · 356 阅读 · 0 评论 -
617. Merge Two Binary Trees(Leetcode每日一题-2020.09.23)
ProblemGiven two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are not.You need to merge them into a new binary tree. The merge rule is that if two nodes overlap, th原创 2020-09-23 21:30:58 · 324 阅读 · 0 评论 -
538. Convert BST to Greater Tree&1038. BST to Greater Sum Tree(Leetcode每日一题-2020.09.22)
ProblemGiven a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus sum of all keys greater than the original key in BST.ExampleSolution右->中->左 遍历/** * Definition fo原创 2020-09-21 19:48:18 · 294 阅读 · 0 评论 -
404. Sum of Left Leaves(Leetcode每日一题-2020.09.19)
ProblemFind the sum of all left leaves in a given binary tree.ExampleSolution首先就是我们只求叶子节点之和(左孩子右孩子为空就可以判断是否为叶子节点),然后需要判断是否是左边的叶子节点,所以我们只需要判断每个节点左边节点是否为空,如果不为空是否为叶子节点,如果成立我们就返回这个左孩子的值再加上向右边孩子进行递归计算的值(右孩子中也有可能有左叶子节点)。/** * Definition for a binary tree原创 2020-09-19 10:49:58 · 407 阅读 · 0 评论 -
226. Invert Binary Tree(Leetcode每日一题-2020.09.16)
ProblemInvert a binary tree.ExampleSolution/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Soluti原创 2020-09-16 20:54:24 · 372 阅读 · 0 评论 -
94. Binary Tree Inorder Traversal(Leetcode每日一题-2020.09.14)
ProblemGiven a binary tree, return the inorder traversal of its nodes’ values.ExampleSolution/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x),原创 2020-09-14 20:50:06 · 423 阅读 · 0 评论 -
637. Average of Levels in Binary Tree(Leetcode每日一题-2020.09.12)
ProblemGiven a non-empty binary tree, return the average value of the nodes on each level in the form of an array.Note:The range of node’s value is in the range of 32-bit signed integer.ExampleSolution/** * Definition for a binary tree node. * str原创 2020-09-13 21:47:45 · 312 阅读 · 0 评论 -
107. Binary Tree Level Order Traversal II(Leetcode每日一题-2020.09.06)
ProblemGiven 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).ExampleGiven binary tree [3,9,20,null,null,15,7],return its bottom-up level order traversal as:So原创 2020-09-06 17:27:59 · 151 阅读 · 0 评论 -
257. Binary Tree Paths(Leetcode每日一题-2020.09.04)
ProblemGiven a binary tree, return all root-to-leaf paths.Note: A leaf is a node with no children.ExampleSolution/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * Tree原创 2020-09-04 20:28:48 · 100 阅读 · 0 评论 -
111. Minimum Depth of Binary Tree(Leetcode每日一题-2020.08.21)
ProblemGiven 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 node.Note: A leaf is a node with no children.ExampleSolution/** * Definition for a binar原创 2020-08-21 20:51:04 · 137 阅读 · 0 评论 -
110. Balanced Binary Tree(Leetcode每日一题-2020.08.17)
ProblemGiven 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 left and right subtrees of every node differ in height by no more than 1.Example1Example2Solutio原创 2020-08-17 22:11:32 · 162 阅读 · 0 评论 -
99. Recover Binary Search Tree(Leetcode每日一题-2020.08.08)--Morris遍历
ProblemTwo elements of a binary search tree (BST) are swapped by mistake.Recover the tree without changing its structure.Example1Example2SolutionMorris遍历从根节点开始遍历,直至当前节点为空为止:如果当前节点没有左儿子,则打印当前节点的值,然后进入右子树;如果当前节点有左儿子,则找当前节点的前驱。(1) 如果前驱节点的右儿子为空,说明原创 2020-08-08 12:27:18 · 182 阅读 · 0 评论 -
100. Same Tree(Leetcode每日一题-2020.08.07)
ProblemGiven two binary trees, write a function to check if they are the same or not.Two binary trees are considered the same if they are structurally identical and the nodes have the same value.Example1Example2Example3Solution/** * Definition f原创 2020-08-08 12:23:43 · 132 阅读 · 0 评论 -
114. Flatten Binary Tree to Linked List(Leetcode每日一题-2020.08.02)
ProblemGiven a binary tree, flatten it to a linked list in-place.ExampleGiven the following tree:The flattened tree should look like:Solution/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; *原创 2020-08-02 09:36:45 · 166 阅读 · 0 评论 -
104. Maximum Depth of Binary Tree(Leetcode每日一题-2020.07.28)
ProblemGiven 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 node.Note: A leaf is a node with no children.ExampleGiven binary tree [3,9,20,null,null,15,原创 2020-07-28 20:21:50 · 115 阅读 · 0 评论 -
95. Unique Binary Search Trees II(Leetcode每日一题-2020.07.21)
ProblemGiven an integer n, generate all structurally unique BST’s (binary search trees) that store values 1 … n.Constraints:0 <= n <= 8ExampleSolution/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeN原创 2020-07-22 21:09:19 · 181 阅读 · 0 评论 -
112. Path Sum(Leetcode每日一题-2020.07.07)
ProblemGiven 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.Note: A leaf is a node with no children.ExampleGiven the below binary tree and sum = 22,return原创 2020-07-07 20:51:53 · 237 阅读 · 0 评论 -
124. Binary Tree Maximum Path Sum(Leetcode每日一题-2020.06.21)
ProblemGiven a non-empty binary tree, find the maximum path sum.For this problem, a path is defined as any sequence of nodes from some starting node to any node in the tree along the parent-child connections. The path must contain at least one node and d原创 2020-06-21 13:26:07 · 191 阅读 · 0 评论 -
1028. Recover a Tree From Preorder Traversal(Leetcode每日一题-2020.06.18)
ProblemWe run a preorder depth first search on the root of a binary tree.At each node in this traversal, we output D dashes (where D is the depth of this node), then we output the value of this node. (If the depth of a node is D, the depth of its immedi原创 2020-06-18 22:40:32 · 246 阅读 · 0 评论