讨论3
解答3:
N0 + N1 + N2 + N3 + ...... + Nm - 1 = 0*N0 +1*N1 + 2*N2 + 3*N3 + ...... + m*Nm N0 - 1 = N2 + 2*N3 + ...... + (m-1)*Nm N0 = N2 + 2*N3 + ...... + (m-1)*Nm + 1
即
二叉树的链表结构:
typedef struct TNode *Position;
typedef Position BinTree; /* 二叉树类型 */
struct TNode{ /* 树结点定义 */
ElementType Data; /* 结点数据 */
BinTree Left; /* 指向左子树 */
BinTree Right; /* 指向右子树 */
};