leetcode(102)：二叉树按层遍历

最新推荐文章于 2024-06-23 15:19:58 发布

xz1308579340

最新推荐文章于 2024-06-23 15:19:58 发布

阅读量139

点赞数

分类专栏： leetcode 文章标签： leetcode 102 二叉树按层遍历

本文链接：https://blog.csdn.net/xz1308579340/article/details/88776254

版权

leetcode 专栏收录该内容

37 篇文章 0 订阅

订阅专栏

题目

Binary Tree Level Order Traversal

Medium

Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level).

For example:
Given binary tree [3,9,20,null,null,15,7],
3
/
9 20
/
15 7
return its level order traversal as:
[
[3],
[9,20],
[15,7]
]

思路

记录每一行的最后一个节点，当前节点等于最后一个就换行
在这里插入图片描述

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
	vector<vector<int>> levelOrder(TreeNode* root) {
	
        queue<TreeNode* > queuePtr;
		queuePtr.push(root);
		TreeNode * last = root;
		TreeNode * nlast = root;
		vector<vector<int>> result;
        if(root==nullptr)
            return result;
		vector<int > row;
		int N = 0;

		while (!queuePtr.empty()) {

			TreeNode* nowPter = queuePtr.front();
			if (nowPter->left != nullptr) {
				queuePtr.push(nowPter->left);
			}

			if (nowPter->right != nullptr) {
				queuePtr.push(nowPter->right);
			}

			row.push_back(nowPter->val);
			
			
			if (nowPter == last) {
				last = queuePtr.back();	
				result.push_back(row);
				row.clear();
			}

			queuePtr.pop();
			

		}
		return result;
	}
};