61.把二叉树打印成多行
题目内容:
代码及思路:
以上述二叉树为例,重点是构建队列!!!
#include<stdio.h>
#include<vector>
#include<queue>
struct TreeNode{
int val;
TreeNode* left;
TreeNode* right;
TreeNode(int x):val(x),left(null),right(null){}
};
void BFS_print(TreeNode* root)
{
queue<TreeNode*> Q;
Q.push(root);
while(!Q.empty())
{
TreeNode* node=Q.front();
Q.pop ();
printf(“[%d]\n”,node->val);
if(node->left)
{
Q.push(node->left);
}
if(node->right)
{
Q.push(node->right);
}
}
};