#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define yn(ans) cout<<(ans?"Yes":"No")<<endl
#define YN(ans) cout<<(ans?"YES":"NO")<<endl
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
//入力系
void scan(int& a){scanf("%d",&a);}
void scan(long long& a){scanf("%lld",&a);}
template<class T> void scan(T& a){cin>>a;}
template<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}
//出力系
void print(const int& a){printf("%d",a);}
void print(const long long& a){printf("%lld",a);}
void print(const double& a){printf("%.15lf",a);}
template<class T> void print(const T& a){cout<<a;}
template<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}
void out(){putchar('\n');}
template<class T> void out(const T& t){print(t);putchar('\n');}
template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}
//デバッグ系
template<class T> void dprint(const T& a){cerr<<a;}
template<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<" "<<*it;}}
void debug(){cerr<<endl;}
template<class T> void debug(const T& t){dprint(t);cerr<<endl;}
template <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<" ";debug(tail...);}

struct Node{
        int parent=-1,sibling=-1,degree=0,left=-1,right=-1,depth=-1,height=-1,attribute=0;
};

int depth(vector<Node>& node,int x){
    if(node[x].parent==-1){
        return 0;
    }else{
        return 1+depth(node,node[x].parent);
    } 
}


int height(vector<Node>& node,int x){
    if(node[x].left==-1&&node[x].right==-1){
        return 0;
    }else{
        if(node[x].left!=-1&&node[x].right!=-1){
            return 1+max(height(node,node[x].left),height(node,node[x].right));
        }else if(node[x].left==-1){
            return 1+height(node,node[x].right);
        }else{
            return 1+height(node,node[x].left);
        }
    } 
}

int main(){
    int n;
    in(n);
    vector<Node> node(n);
    int x,l,r;
    rep(i,n){
        in(x,l,r);
        node[x].left=l;
        node[x].right=r;
        if(l!=-1){
            node[l].parent=x;
            node[l].sibling=r;
            node[x].degree++;
            node[x].attribute++;
        }
        if(r!=-1){
            node[r].parent=x;
            node[r].sibling=l;
            node[x].degree++;
            node[x].attribute++;
        }
    }
    rep(i,n){
        printf("node %d:",i);
        printf(" parent = %d",node[i].parent);
        printf(", sibling = %d",node[i].sibling);
        printf(", degree = %d",node[i].degree);
        printf(", depth = %d",depth(node,i));
        printf(", height = %d, ",height(node,i));
        if(node[i].parent==-1)printf("root");
        else if(node[i].attribute==0)printf("leaf");
        else printf("internal node");
        printf("\n");
    }
}


Measured memory_bytes: 3220