Tree
文章平均质量分 73
ForABiggerWorld
这个作者很懒,什么都没留下…
展开
-
1443. Minimum Time to Collect All Apples in a Tree
Given an undirected tree consisting ofnvertices numbered from 0 ton-1, which has some apples in theirvertices. You spend 1 second to walk over oneedge of the tree.Return the minimum time in secondsyou have to spendin order to collect all apples in ...原创 2020-05-12 23:50:14 · 422 阅读 · 0 评论 -
1325. Delete Leaves With a Given Value
Given a binary treerootand an integertarget, delete all theleaf nodeswith valuetarget.Notethat once you delete a leaf node with valuetarget,if it's parent node becomes a leaf node and has t...原创 2020-01-25 21:15:29 · 206 阅读 · 0 评论 -
979. Distribute Coins in Binary Tree
Given the root of a binary tree with N nodes, each node in the tree has node.val coins, and there are N coins total.In one move, we may choose two adjacent nodes and move one coin from one node to a...原创 2019-01-20 12:00:20 · 276 阅读 · 0 评论 -
1026. Maximum Difference Between Node and Ancestor
Given therootof a binary tree, find the maximum valueVfor which there existsdifferentnodesAandBwhereV = |A.val - B.val|andAis an ancestor ofB.(A node A is an ancestor of B if either: ...原创 2019-04-14 20:10:35 · 287 阅读 · 0 评论 -
1028. Recover a Tree From Preorder Traversal
We run apreorderdepth first search on therootof a binary tree.At each node in this traversal, we outputDdashes (whereDis thedepthof this node), then we output the value of this node.(If ...原创 2019-04-14 20:17:48 · 341 阅读 · 0 评论 -
5084. Insufficient Nodes in Root to Leaf Paths
Given therootof a binary tree, consider allroot to leaf paths: paths from the rootto any leaf. (A leaf is a node with no children.)Anodeisinsufficientifeverysuch root to leaf path interse...原创 2019-06-09 14:08:36 · 447 阅读 · 0 评论 -
1123. Lowest Common Ancestor of Deepest Leaves
Given a rooted binary tree, find the lowest common ancestor of its deepest leaves.Recall that:The node of a binary tree is aleafif and only if it has no children Thedepthof the root of the tr...原创 2019-07-14 14:00:45 · 385 阅读 · 0 评论 -
1104. Path In Zigzag Labelled Binary Tree
In an infinite binary tree where every node has two children, the nodes are labelled in row order.In the odd numbered rows (ie., the first, third, fifth,...), the labelling is left to right, while i...原创 2019-06-30 14:07:49 · 327 阅读 · 0 评论 -
1110. Delete Nodes And Return Forest
Given therootof a binary tree, each node in the tree has a distinct value.After deletingall nodes with a value into_delete, we are left with a forest (adisjoint union of trees).Return the roo...原创 2019-07-07 12:00:22 · 408 阅读 · 0 评论 -
1145. Binary Tree Coloring Game
Two players play a turn based game on a binary tree. We are giventherootof this binary tree, and the number of nodesnin the tree.nis odd, andeach node has a distinct value from1ton.Initi...原创 2019-08-04 12:03:45 · 830 阅读 · 1 评论 -
971. Flip Binary Tree To Match Preorder Traversal
Given a binary tree with N nodes, each node has a different value from {1, ..., N}.A node in this binary tree can be flipped by swapping the left child and the right child of that node.Consider th...原创 2019-01-06 12:17:09 · 345 阅读 · 2 评论 -
919. Complete Binary Tree Inserter
A complete binary tree is a binary tree in which every level, except possibly the last, is completely filled, and all nodes are as far left as possible.Write a data structure CBTInserter that is ini...原创 2018-10-07 11:04:51 · 265 阅读 · 0 评论 -
331. Verify Preorder Serialization of a Binary Tree
One way to serialize a binary tree is to use pre-order traversal. When we encounter a non-null node, we record the node's value. If it is a null node, we record using a sentinel value such as #....原创 2017-07-23 09:30:49 · 240 阅读 · 0 评论 -
606. Construct String from Binary Tree
You need to construct a string consists of parenthesis and integers from a binary tree with the preorder traversing way.The null node needs to be represented by empty parenthesis pair "()". And you ne...原创 2017-10-11 13:13:16 · 191 阅读 · 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 ...原创 2017-09-28 12:26:29 · 202 阅读 · 0 评论 -
687. Longest Univalue Path
Given a binary tree, find the length of the longest path where each node in the path has the same value. This path may or may not pass through the root.Note: The length of path between two nodes i原创 2017-10-02 15:35:11 · 748 阅读 · 0 评论 -
776. Split BST
Given a Binary Search Tree (BST) with root node root, and a target value V, split the tree into two subtrees where one subtree has nodes that are all smaller or equal to the target value, while the原创 2018-02-04 17:39:55 · 420 阅读 · 0 评论 -
814. Binary Tree Pruning
We are given the head node root of a binary tree, where additionally every node's value is either a 0 or a 1.Return the same tree where every subtree (of the given tree) not containing a 1 has been re...原创 2018-04-08 12:04:39 · 218 阅读 · 0 评论 -
440. K-th Smallest in Lexicographical Order
Given integers n and k, find the lexicographically k-th smallest integer in the range from 1 to n.Note: 1 ≤ k ≤ n ≤ 109.Example:Input:n: 13 k: 2Output:10Explanation:The lexicographical order ...原创 2018-04-09 16:05:12 · 135 阅读 · 0 评论 -
863. All Nodes Distance K in Binary Tree
We are given a binary tree (with root node root), a target node, and an integer value `K`.Return a list of the values of all nodes that have a distance K from the target node. The answer can be retur...原创 2018-07-01 11:52:00 · 360 阅读 · 0 评论 -
866. Smallest Subtree with all the Deepest Nodes
Given a binary tree rooted at root, the depth of each node is the shortest distance to the root.A node is deepest if it has the largest depth possible among any node in the entire tree.The subtree of ...原创 2018-07-08 11:21:07 · 378 阅读 · 0 评论 -
894. All Possible Full Binary Trees
A full binary tree is a binary tree where each node has exactly 0 or 2 children.Return a list of all possible full binary trees with N nodes. Each element of the answer is the root node of one p...原创 2018-08-27 10:33:22 · 449 阅读 · 0 评论 -
742. Closest Leaf in a Binary Tree
Given a binary tree where every node has a unique value, and a target key k, find the closest leaf node to target k in the tree.A node is called a leaf if it has no children.In the following examples,...原创 2017-12-10 12:24:26 · 759 阅读 · 0 评论