[LeetCode] Find Bottom Left Tree Value 尋找最左下樹結點的值
Given a binary tree, find the leftmost value in the last row of the tree. Example 1: Example 2: Note: You may assume the tree (i.e. ...
原文：[LeetCode] Find Largest Value in Each Tree Row 找樹每行最大的結點值
You need to find the largest value in each row of a binary tree. Example: 這道題讓我們找二叉樹每行的最大的結點值，那么實際上最直接的方法就是用層序遍歷，然后在每一層中找到最大值，加入結果res中即可，參見代碼如下： 解法一： 如果我們想用迭代的方法來解，可以用先序遍歷，這樣的話就需要維護一個深度變量depth，來記錄當前結 ...
2017-02-19 23:29 0 3871 推薦指數：
相關推薦
[LeetCode] 270. Closest Binary Search Tree Value 最近的二分搜索樹的值
Given a non-empty binary search tree and a target value, find the value in the BST that is closest to the target. Note: Given target value ...
[LeetCode] 272. Closest Binary Search Tree Value II 最近的二分搜索樹的值之二
Given a non-empty binary search tree and a target value, find k values in the BST that are closest to the target. Note: Given target value ...
[LeetCode] 410. Split Array Largest Sum 分割數組的最大值
an algorithm to minimize the largest sum among these m ...
[LeetCode] Find Leaves of Binary Tree 找二叉樹的葉節點
Given a binary tree, collect a tree's nodes as if you were doing this: Collect and remove all leaves, repeat until the tree is empty. Example ...
[LeetCode] Find Mode in Binary Search Tree 找二分搜索數的眾數
Given a binary search tree (BST) with duplicates, find all the mode(s) (the most frequently occurred element) in the given BST. Assume a BST ...
[LeetCode] Insert into a Binary Search Tree 二叉搜索樹中插入結點
Given the root node of a binary search tree (BST) and a value to be inserted into the tree, insert the value into the BST. Return the root node ...
[LeetCode] Largest Palindrome Product 最大回文串乘積
Find the largest palindrome made from the product of two n-digit numbers. Since the result could be very large, you should return the largest ...