Given a binary tree, find the leftmost value in the last row of the tree. Example : Example : Note:You may assume the tree i.e., the given root node is notNULL. 这道题让我们求二叉树的最左下树结点的值，也就是最后一行左数第一个值，那么我首 ...
2017-02-16 12:28 4 5679 推荐指数：
You need to find the largest value in each row of a binary tree. Example: 这道题让我们找二叉树每行的最大的结点值，那么实际上最直接的方法就是用层序遍历，然后在每一层中找到最大值，加入结果res中即可，参见 ...
letter at a random position. Find the letter that was a ...
[4,5,6,7,0,1,2]). Find the minimum element. You may assume no ...
to find an index mapping P, from A to B. A mapping P[ ...
Suppose you are at a party with n people (labeled from 0 to n - 1) and among them, there may exis ...
Given a binary tree, return all duplicate subtrees. For each kind of duplicate subtrees, you only need to return the root node of any oneof ...
the sum of the numbers to the left of the index is equal ...
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 ...
