正确
左孩子2*i,右孩子2*i+1

还有就是用
树的基本形式拉

void InOrderTraverse(BiTNode *T)
{
     BiTNode *p;
     
     p = T;
     while(sp || p)
     {
         if(p)
         {
             Push(p);               /*根指针栈,便历左子树*/ 
             p = p->lchild;
         }//if         
         else
         {
             p = Pop();
             printf("%4c", p->data);/*根指针退栈,遍历右子树*/
             p = p->rchild;
         }//else
     }//while
}