Binary tree - right view

Question source ：LeetCode

• Problem description
• 
• Algorithmic thought
  The node seen from the right must be the last node of each layer , Therefore, using hierarchical traversal , Find the last node of each layer

void rightElevation(BiTree T){
    
	if(!T) return null;
	BiTree Q[MAXSISE],temp[MAXSIZE];
	int rear=-1,front=-1,last=0;
	
	TNode *p;
	int i=0;
	while(rear>front){
    
		Q[++front]=p;
		if(p->lchild) Q[++rear]=p->lchild;
        if(p->rchild) Q[++rear]=p->rchild;
		if(last==front){
    
			temp[i++]=p;
			last = rear;
		}
	}
	for(int j=0;j++) print(temp[i]);
}