#include <queue>

 using namespace std;

 void IsComplete(node* root)

 {

     queue<node*> q;

     q.push(root);

     while(!q.empty())

     {

         root = q.front();

         q.pop();

         if(root)

         {

             q.push(root->lchild);

             q.push(root->rchild);

         }

         else

         {

             while(!q.empty())

             {

                 root = q.front();

                 q.pop();

                 if(root)

                 {

                     printf("No\n");

                     return ;

                 }

             }

         }

     }

     printf("Yes\n");

 }