>typedef struct bitnode
>void createbitree(t,n). E& u. \, z+ a1 k$ f3 g
>void visit(e)
>void preordertraverse(t)
>void countleaf(t,c)
>int treehigh(t)- V. j, w; z+ s) ^8 `. `7 J
>main()$ I" d2 [# i; O* B' ~, [3 N2 E
>不错啊。% j" q1 k+ Y, i' n| 欢迎光临 数学建模社区-数学中国 (http://www.madio.net/) | Powered by Discuz! X2.5 |