DFS
X丶
这个作者很懒,什么都没留下…
展开
-
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 · 129 阅读 · 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 · 125 阅读 · 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 · 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 · 110 阅读 · 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 · 368 阅读 · 0 评论