二叉树分层遍历

最新推荐文章于 2023-10-06 09:34:51 发布

-TianSF-

最新推荐文章于 2023-10-06 09:34:51 发布

阅读量356

点赞数

分类专栏：数据结构和算法

本文链接：https://blog.csdn.net/artisans/article/details/89217111

版权

数据结构和算法专栏收录该内容

4 篇文章 0 订阅

订阅专栏

class Solution
{
 public:
	bool isSymmetric(TreeNode* root)
	{
		if (!root) return true;
		vector<TreeNode*> vec;
		vec.push_back(root);
		int cur = 0;

		while (cur < vec.size())
		{
			int S = vec.size();
			while (cur < S)
			{
				TreeNode* curNode = vec[cur];
				cout << curNode->val << "\t";
				if (curNode->left)
					vec.push_back(curNode->left);

				if (curNode->right)
					vec.push_back(curNode->right);
				cur++;
			}
			cout << "\n";
		}

		return true;
	}
};