設計壹個算法把二叉數的葉子結點按從左到右的順序連成壹個單鏈表,二叉樹按ldchild-rchild方式存儲,?

按 先序 或 中序 遍歷該2叉樹.

當碰到葉子節點 c 時:

p->rchild = c;

p = c;

遍歷結束,返回h

*****************************

struct Node{

DateType date;

struct Node *lchild,*rchild

}*h,*p;

main()

{

*h = (Node *)malloc(sizeof(Node));

*p = h;

Node *tree;

/*取得2叉樹*/

...

/*遍歷*/

PreOderTraverse(tree);

p = h->rchild;

free(h);

/*輸出p*/

...

}

PreOrderTraverse(Node node)

{

if(node == null) return;

if(node->lchild == null && node->rchild == null)

{p->rchild = node;

p = node;

return;

}

PreOrderTraverse(node->lchild)

PreOrderTraverse(node->rchild)

}