(2)后根次序周游 算法6.3后根次序周游的递归表示 procedure POSTORDER T 是一棵二元树。T的每个结点有三个信 息段: LCHILD,DATA, RCHILD/ ifT≠0then call POSTORDER LCHILD T) call POSTORDER(RCHILD(T)) call VISIT(T) endif end preorder⑵后根次序周游 算法6.3 后根次序周游的递归表示 procedure POSTORDER(T) //T是一棵二元树。T的每个结点有三个信 息段:LCHILD,DATA,RCHILD// if T≠0 then call POSTORDER(LCHILD(T)) call POSTORDER(RCHILD(T)) call VISIT(T) endif end PREORDER