[LeetCode] [C++] 515. Find Largest Value in Each Tree Row

原创于 2017-11-21 22:31:04 发布 · 211 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#LeetCode #C++ #Data Structure #Binary Tree

LeetCode 同时被 3 个专栏收录

7 篇文章

订阅专栏

Freshman

7 篇文章

订阅专栏

C++

3 篇文章

订阅专栏

本文介绍了一种解决二叉树层序遍历问题的方法，通过使用队列实现，找到每层的最大值，并提供了运行时间为13毫秒、代码长度为630字节的具体实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

When seeing this problem,

which let us find something in each tree row,

I thought I could solve this problem by using "Level-order Traversal".

The code is as follows.

The Runtime of the program is 13 ms.

The length of the code is 630Bytes.

class Solution {
public:
    vector<int> largestValues(TreeNode* root) {
        vector<int> v;
        if (root==NULL) return v;
        queue<TreeNode*> qe;
        int i,size,max;
        qe.push(root);
        while (!qe.empty()) {
            size=qe.size();
            for (i=0, max=qe.front()->val; i<size; i++) {
                TreeNode* p = qe.front();
                qe.pop();
                if (p->val>max)
                    max=p->val;
                if (p->left) qe.push(p->left);
                if (p->right) qe.push(p->right);
            }
            v.push_back(max);
        }
        return v;
    }
};