Find Largest Value in Each Tree Row

最新推荐文章于 2022-07-08 08:19:09 发布

K.Sun

最新推荐文章于 2022-07-08 08:19:09 发布

阅读量257

点赞数

分类专栏： Algorithm Leetcode Data Structure 文章标签：二叉树遍历

本文链接：https://blog.csdn.net/sinat_36246371/article/details/58134183

版权

Algorithm 同时被 3 个专栏收录

139 篇文章 1 订阅

订阅专栏

Leetcode

112 篇文章 0 订阅

订阅专栏

Data Structure

48 篇文章 0 订阅

订阅专栏

You need to find the largest value in each row of a binary tree.

Example:

Input: 

          1
         / \
        3   2
       / \   \  
      5   3   9 

Output: [1, 3, 9]

还是做好行遍历就行了，代码与[Find Bottom Left Tree Value]的结构基本相似，做好每一行的最大值存储即可：

public class FindLargestValueinEachTreeRow {
    public static List<Integer> largestValues(TreeNode root) {
        List<Integer> res = new ArrayList<>();

        if (root == null)
            return res;

        res.add(root.val);

        LinkedList<TreeNode> levelNodes = new LinkedList<>();

        if (root.left == null && root.right == null) {
            return res;
        }

        levelNodes.add(root);

        while (!levelNodes.isEmpty()) {
            LinkedList<TreeNode> tempLevel = new LinkedList<>();
            for (TreeNode node : levelNodes) {
                if (node.left != null)
                    tempLevel.add(node.left);
                if (node.right != null)
                    tempLevel.add(node.right);
            }

            if (!tempLevel.isEmpty()) {
                int max = (int) (tempLevel.get(0).val);
                for (TreeNode node : tempLevel) {
                    if (node.val > max)
                        max = node.val;
                }
                res.add(max);
                levelNodes.clear();
                levelNodes.addAll(tempLevel);
            } else {
                break;
            }

        }
        return res;
    }

    public static void main(String[] args) {
        TreeNode root = new TreeNode(1);
        root.left = new TreeNode(3);
        root.right = new TreeNode(2);
        root.left.left = new TreeNode(5);
        root.left.right = new TreeNode(3);
        root.right.right = new TreeNode(9);

        System.out.println(largestValues(root));
    }

}