import java.util.*;
public class Main {
/**
//该段代码仅用于调试,提交时请注释该段代码
class TreeNode<T> {
public T data;
public TreeNode<T> left;
public TreeNode<T> right;
}
*/
public boolean solution(TreeNode<Integer> root) {
if(root ==null){
return true;
}
Queue<TreeNode<Integer>> q = new LinkedList<>();
TreeNode<Integer>p=root;
q.add(p);
int num = 1;
while (q.isEmpty() == false)
{
int sz = q.size();
if(sz != num){
return false;
}
while(sz != 0){
p = q.poll();
if (p.left != null)
{
q.add(p.left);
}
if (p.right != null)
{
q.add(p.right);
}
sz--;
}
num *= 2;
}
return true;
}
}