数据结构
网络
RDBMS
操作系统
Java
MS Excel
iOS
HTML
CSS
Android
Python
C 编程
C++
C#
MongoDB
MySQL
Javascript
PHP
物理学
化学
生物学
数学
英语
经济学
心理学
社会学
时尚研究
法律研究无递归中序树遍历的 C++ 程序
如果以中序遍历二叉树，则首先访问左子树，接着访问根，然后访问右子树。中序遍历按升序输出键。这是无递归中序树遍历的 C++ 程序。
算法
Begin Function inOrder(): Declare a stack s. Declare the current node as root. While current node is not null and stack is not empty do While current node is not null do Push the current node on the top of the stack Make the left child node as current node Point the current node at the top of the stack. Pop the top most node from the stack Print the current node. Make the right node as current node. Insert some elements at root, left node and right node in stack. Call the inOrder() function to traverse the tree. End.
示例代码
#include<bits/stdc++.h>
using namespace std;
struct n {
int d;
struct n* l;
struct n* r;
n (int d) {
this->d = d;
l = r = NULL;
}
};
void inOrder(struct n *root) {
stack<n *> s;
n *current = root;
while (current != NULL || s.empty() == false) {
while (current != NULL) {
s.push(current);
current = current->l;
}
current = s.top();
s.pop();
cout << current->d << " ";
current = current->r;
}
}
int main() {
struct n *root = new n(7);
root->l = new n(6);
root->r = new n(2);
root->l->l = new n(1);
root->l->r = new n(9);
inOrder(root);
return 0;
}输出
1 6 9 7 2
更新日期：2019 年 7 月 30 日
575 次浏览
广告