typedef int DataType ;
struct SeqBinTree{
    int MAXNUM;
    int n;
    DataType *nodelist;  
};

typedef SeqBinTree* PSeqBinTree;

int parent_seq(PSeqBinTree tree,int p){
    if(p<0||p>=tree->n)return -1;
    return (p-1)/2;
}

int leftChild_seq(PSeqBinTree tree){
    if(p<0||p>tree->n) return -1;
    return (p-1)/2;
}

int leftChild_seq(PSeqBinTree tree){
    if(p<0||p>tree->n) return -1;
    return 2*p+1;
}

int leftChild_seq(PSeqBinTree tree){
    if(p<0||p>tree->n) return -1;
    return 2*p+2;
}