c语言 树的层序遍历

运行结果正确
层序遍历比先序递归和非递归都要简单。

#include <stdio.h>
#include <stdlib.h>
typedef struct tree_node{
   
	int val;
	struct tree_node *left;
	struct tree_node *right;
}tree,*tree_point;
//创建新树
int creat_tree(tree **t){
   
	int val;
	
	scanf("%d",&val);
	if