1110 Complete Binary Tree (25 分)

按照层序给树排下标，若最大下标值等于节点数，该树就是完全二叉树。

#include <iostream>
#include <cstdio>
#include <vector>
#include <cstring>
using namespace std;
struct node{
	int l,r;
}Node[25];
int maxn,ans=-1;
void dfs(int root,int index){
	if(index>ans){
		maxn=root;
		ans=index;
	}
	if(Node[root].l!=-1) dfs(Node[root].l,index*2);
	if(Node[root].r!=-1)dfs(Node[root].r,index*2+1);
}
int main() {
    int n,have[25]={0};
    cin>>n;
    for(int i=0;i<n;i++){
    	string l,r;
    	cin>>l>>r;
    	if(l!="-"){
    		Node[i].l=stoi(l);
    		have[stoi(l)]=1;
		}else{
			Node[i].l=-1;
		}
		if(r!="-"){
			Node[i].r=stoi(r);
			have[stoi(r)]=1;
		}else{
			Node[i].r=-1;
		}
	}
	int root=0;
	while(have[root]==1) root++;
	dfs(root,1);
	if(ans==n){
		cout<<"YES "<<maxn<<endl;
	}else{
		cout<<"NO "<<root<<endl;
	}
    return 0;
}