1110 Complete Binary Tree

#include<bits/stdc++.h>
using namespace std;
#define mst(x,y) memset(x,y,sizeof(x))
#define rep(x,y,z) for(int x=(y);(x)<(z);x++)
#define fi first
#define se second
#define mk(x,y) make_pair(x,y)
#define pii pair<int,string>
const int maxn=1e4+10;
int x,y,n;
int dp[maxn*100];
int L[maxn],R[maxn];
void dfs(int u,int d){
    if(u==-1) return ;
    dp[d]=u;
    dfs(L[u],d<<1);
    dfs(R[u],(d<<1)+1);
}
int vis[maxn];
int solve(string s){
    if(s[0]=='-') return -1;
    if(s.size()==1) return s[0]-'0';
    return (s[0]-'0')*10+(s[1]-'0');
}
int main(){
    cin>>n;
    mst(dp,-1);
    rep(i,0,n){
        string s;
        cin>>s;x=solve(s);
        cin>>s;y=solve(s);
        L[i]=x;if(~x) vis[x]=1;
        R[i]=y;if(~y) vis[y]=1;
    }
    int root=0;rep(i,0,n) if(vis[i]==0) root=i;
    dfs(root,1);
    
    int flag=1,ret=0;
    rep(i,1,n+1) if(dp[i]==-1) flag=0;
    if(flag) cout<<"YES"<<" "<<dp[n]<<endl;
    else cout<<"NO"<<" "<<root<<endl;
 	return 0;   
}