从上往下打印二叉树

YOONGI

于 2020-07-11 14:49:22 发布

阅读量141

点赞数

分类专栏：剑指offer

本文链接：https://blog.csdn.net/chimchim04/article/details/107284818

版权

剑指offer 专栏收录该内容

59 篇文章 1 订阅

订阅专栏

题目描述

从上往下打印出二叉树的每个节点，同层节点从左至右打印。

题目链接:https://www.nowcoder.com/practice/7fe2212963db4790b57431d9ed259701?tpId=13&&tqId=11175&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking

代码：

/*
struct TreeNode {
	int val;
	struct TreeNode *left;
	struct TreeNode *right;
	TreeNode(int x) :
			val(x), left(NULL), right(NULL) {
	}
};*/
class Solution {
public:
    vector<int> PrintFromTopToBottom(TreeNode* root) {
        queue<TreeNode*>q;
        vector<int>res;
        if(root==NULL) return res;
        q.push(root);
        TreeNode* now=NULL;
        while(!q.empty())
        {
            now=q.front();
            q.pop();
            res.push_back(now->val);
            if(now->left) q.push(now->left);
            if(now->right) q.push(now->right);
        }
        return res;
    }
};