二叉樹的中序遍歷非遞歸方法（算法導(dǎo)論第三版12.1-3）

1??用棧實(shí)現(xiàn)

template<typename T> void inorder_tree_walk_non_recursion_by_stack(BinaryTreeNode<T> *node) {Stack<BinaryTreeNode<T>*> stack;stack.push(node);while (!stack.empty()){BinaryTreeNode<T> * current = stack.pop();if(current->right!= nullptr)stack.push(current->right);std::cout<<current->key<<" ";if(current->left!= nullptr)stack.push(current->left);} }

2??非棧實(shí)現(xiàn)

template<typename T> void inorder_tree_walk_non_recursion(BinaryTreeNode<T>* node) {BinaryTreeNode<T>* perv = nullptr;BinaryTreeNode<T>* current = node;while (current!= nullptr){if(current->parent == perv){std::cout<<current->key<<" ";perv = current;if(current->left!= nullptr){current = current->left;}else if(current->right!= nullptr){current = current->right;}elsecurrent = current->parent;}else if(current->right!= nullptr && perv == current->left){perv = current;current = current->right;}else{perv = current;current = current->parent;}} }

輔助類
1??BinaryTreeNode地址
2??Stack地址

測(cè)試代碼

BinaryTreeNode<int>* node1 = new BinaryTreeNode<int>(1);BinaryTreeNode<int>* node2 = new BinaryTreeNode<int>(2);BinaryTreeNode<int>* node3 = new BinaryTreeNode<int>(3);BinaryTreeNode<int>* node4 = new BinaryTreeNode<int>(4);BinaryTreeNode<int>* node5 = new BinaryTreeNode<int>(5);BinaryTreeNode<int>* node6 = new BinaryTreeNode<int>(6);BinaryTreeNode<int>* node7 = new BinaryTreeNode<int>(7);BinaryTreeNode<int>* node8 = new BinaryTreeNode<int>(8);node1->left = node2;node1->right = node3;node2->parent = node1;node2->left = node4;node2->right = node5;node3->parent = node1;node3->left = node6;node3->right = node7;node4->parent = node2;node4->left = node8;node5->parent = node2;node6->parent = node3;node7->parent = node3;node8->parent = node4;inorder_tree_walk_non_recursion_by_stack(node1);cout<<endl;inorder_tree_walk_non_recursion(node1);cout<<endl;

總結(jié)

以上是生活随笔為你收集整理的二叉树的中序遍历非递归方法（算法导论第三版12.1-3）的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。