二叉树基本操作:p121 (1)createbitree(t)(2)destroybitree(t) root(t) (4)leftchild(t) (5)rightchild(t)(6)locate(t,x) ()parent(t,x)(8)isempty(t) (9)depth(t) (10)numofnode(t (11)addchild(t, x, t1, b)(12)deletechild(t, x, b) (13)setnull(t)(14)isequal(t1, t2) (15) preorder(t) (16)inorder(t) (17)postorder(t)(18)transform(t1, t2)二叉树基本操作：p121 (1)createbitree(t) (2)destroybitree(t) (3)root(t) (4)leftchild(t) (5)rightchild(t) (6)locate(t,x) (7)parent(t,x) (8)isempty(t) (9)depth(t) (10)numofnode(t) (11)addchild(t,x,t1,b) (12)deletechild(t,x,b) (13)setnull(t) (14)isequal(t1,t2) (15)preorder(t) (16)inorder(t) (17)postorder(t) (18)transform(t1,t2)