N-1

  a 011 b 10 c 00 d 010 e 11

129

(1)a (2)b,d,f,g,h,i,j,k (3)a,c,g (4)i (5)4

depth(t->rchild); hl>hr

bt InOrderTraverse(bt->rchild);

​      d n0 =( Σ n(i) * (i - 1)) + 1            (其中，i ∈ Integer，d为树的度) ​     i=1

0 1 3 0 2 1 1 0 1 2 1 2 2 2 1 3 2 -2

tail((a,b,c),(x,y,z))=((x,y,z)) head((x,y,z))=(x,y,z)

LOC(A[0][0])+(n*i+j)*k

i-j+1 i-t->len+1

next[j] i-t->len+1

s->next=p->next p->next=s

弱智

DCBA CDBA CBDA CBAD BDCA BCDA BADC BACD ADCB ACDB ACBD ABDC ABCD BCAD  

push(S,N) N<8   push(S,N%8) !StackEmpty(S)

15