树
X丶
这个作者很懒,什么都没留下…
展开
-
865. Smallest Subtree with all the Deepest Nodes(‘找小弟’思想)
problem:Given a binary tree rooted atroot, thedepthof each node is the shortest distance to the root.A node isdeepestif it has the largest depth possible amongany node in theentire tree....原创 2019-05-19 21:46:39 · 145 阅读 · 0 评论 -
1026. Maximum Difference Between Node and Ancestor(递归+记录最大最小值)
problem: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 ...原创 2019-05-17 19:49:26 · 376 阅读 · 0 评论 -
889. Construct Binary Tree from Preorder and Postorder Traversal (用stack构建树)
Return any binary tree that matches the given preorder and postorder traversals.Values in the traversalspreandpostare distinctpositive integers.Example 1:Input: pre = [1,2,4,5,3,6,7], ...原创 2019-05-17 11:34:52 · 108 阅读 · 0 评论 -
1008. Construct Binary Search Tree from Preorder Traversal(lower and upper)
Return the root node of a binarysearchtree that matches the givenpreordertraversal.(Recall that a binary search treeis a binary tree where for everynode, any descendant ofnode.lefthas a val...原创 2019-05-13 15:02:25 · 116 阅读 · 0 评论 -
1028. Recover a Tree From Preorder Traversal(用stack构建树)
problem: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 ...原创 2019-05-13 14:37:09 · 327 阅读 · 0 评论 -
669. Trim a Binary Search Tree(‘找小弟’思想)
problem:Given a binary search tree and the lowest and highest boundaries asLandR, trim the tree so that all its elements lies in[L, R](R >= L). You might need to change the root of the tree...原创 2019-05-17 11:13:57 · 117 阅读 · 0 评论 -
872. Leaf-Similar Trees(迭代法配合stack获取所有叶子结点)
problem:Consider all the leaves of a binary tree. Fromleft to right order, the values of thoseleaves form aleaf value sequence.For example, in the given tree above, the leaf value sequence ...原创 2019-05-17 10:51:51 · 132 阅读 · 0 评论 -
617. Merge Two Binary Trees(‘抢小弟’思想)
problem:Given 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 ...原创 2019-05-12 22:35:06 · 106 阅读 · 0 评论 -
979. Distribute Coins in Binary Tree
Problem:Given therootof a binary tree withNnodes, eachnodein the tree hasnode.valcoins, and there areNcoins total.In one move, we may choose two adjacent nodes and move one coin from on...原创 2019-05-12 22:02:53 · 133 阅读 · 0 评论 -
Maximum Binary Tree
Given an integer array with no duplicates. A maximum tree building on this array is defined as follow:The root is the maximum number in the array. The left subtree is the maximum tree constructed ...原创 2019-05-10 11:45:54 · 146 阅读 · 0 评论 -
My Calendar
leetcode problem:My Calendar1Implement aMyCalendarclass to store your events. A new event can be added if adding the event will not cause a double booking.Your class will have the method,book(...原创 2019-05-10 11:21:54 · 1107 阅读 · 0 评论 -
951. Flip Equivalent Binary Trees(左右交叉走思想)
problem:For a binary tree T, we can define a flip operation as follows: choose any node, and swap the left and right child subtrees.A binary tree Xisflip equivalentto a binary tree Y if and on...原创 2019-05-17 20:03:22 · 255 阅读 · 0 评论