leetcode513 FindBottomLeftTreeValue Java

最新推荐文章于 2021-05-06 18:42:00 发布

店小不二

最新推荐文章于 2021-05-06 18:42:00 发布

阅读量224

点赞数

分类专栏： leetcode 文章标签： leetcode java

本文链接：https://blog.csdn.net/u013190088/article/details/60141612

版权

leetcode 专栏收录该内容

41 篇文章 0 订阅

订阅专栏

Description

Given a binary tree, find the leftmost value in the last row of the tree.

Example 1:
Input:

2
/ \
1 3

Output:
1
Example 2:
Input:

Output:
7
Note: You may assume the tree (i.e., the given root node) is not NULL.

解法1

递归算法很好理解

int res = 0,h = 0;
public int findBottomLeftValue(TreeNode root) {
    findBottomLeftValue(root, 1);
    return res;
}
public void findBottomLeftValue(TreeNode root, int depth) {
    if(h < depth) {res=root.val; h=depth;}
    if(root.left != null) findBottomLeftValue(root.left, depth+1);
    if(root.right !=null) findBottomLeftValue(root.right, depth+1);
}

解法2

非递归顺序遍历，用队列存储每一行的节点。循环结束，队列中的第一个即为结果。

public int findBottomLeftValue(TreeNode root) {
    int result = 0;
    Queue<TreeNode> queue = new LinkedList<>();
    queue.offer(root);
    while(! queue.isEmpty()) {
        int size = queue.size();
        for(int i=0; i<size; i++) {
            TreeNode curr = queue.poll();
            if(i == 0) result = curr.val;
            if(curr.left != null) queue.offer(curr.left);
            if(curr.right != null) queue.offer(curr.right);
        }
    }
    return result;
}