华南理工大学数据结构与算法课件Chapter6 Trees and Binary Trees.pptVIP

Program 6-9 non-recursive binary tree traversal algorithm: template class T void BinaryTree T:: InOrderTraverse (BinTreeNode T * r) {Template class T void BinaryTree T:: InOrderTraverse2 (BinTreeNode T * r) {/ / Binary tree in order traversal non-recursive algorithm, using binary storage structure list SeqStack BinTreeNode T * s; BinTreeNode T * p;p = r; while (p | |! s.IsEmpty ()) {If (p) {s.Push (p); p = p- GetLeftChild ();} / / if else {s.Pop (p); if (p == NULL) return; else cout p- GetData () endl; p = p- GetRightChild (); } / / Else } / / While } 4.T