前序遍历伪代码:
栈s;
p = root;
while(p || s 不为空)
while(p)
访问p;
p右入栈;
p = p左;
p = s顶;
弹出s顶;
}
}
后序遍历:
栈s;
p = root;
while(p || s 不为空)
while(p)
访问p;
p左入栈;
p = p右;
p = s顶;
弹出s顶;
}
}
p逆序输出
中序遍历:
栈s;
p = root;
while(p || s 不为空)
while(p)
p入栈;
p = p左;
p = s顶;
弹出s顶;
访问p;
p = p右;
}
}
【二叉树遍历迭代伪代码】前序遍历、中序遍历、后序遍历
最新推荐文章于 2023-06-09 19:29:41 发布