InitTree(&t) Assign(&t, cur e, val) Destroy Tree(&t) Parent(t,cur e Create Tree(&T, definition ) FirstChild(T, cur_ e) Clear Tree(&T RightSibling(t,cur e) TreeEmpty (t Insert Child( &T,p, i,c) TreeDepth(t Delete Child (&T,p, i) Root(t TraverseTree(T) value(t, cur e) J//ADT Tree pboustc. edu. cn 中国科学技术大学ypb@ustc.edu.cn 4 中国科学技术大学 InitTree(&T); DestroyTree(&T); CreateTree(&T,definition); ClearTree(&T); TreeEmpty(T); TreeDepth(T); Root(T); Value(T,cur_e); }//ADT Tree Assign(&T,cur_e,val); Parent(T,cur_e); FirstChild(T,cur_e); RightSibling(T,cur_e); InsertChild(&T,p,i,c); DeleteChild(&T,p,i); TraverseTree(T);