[leetcode]Binary Tree Inorder Traversal
来源:互联网 发布:淘宝买家信用度怎么升 编辑:程序博客网 时间:2024/06/03 22:46
题目分析:非递归实现对一颗树的中序遍历,可以用栈实现。
贴一下思路:
树根入栈;while(栈不空){if(栈顶节点有左儿子){栈顶节点左儿子入栈;原栈顶节点左儿子置空; } else if(栈顶节点有右儿子){ 打印栈顶节点;弹栈;弹栈前的栈顶节点右儿子入栈; }else{打印栈顶节点;弹栈;}}
0 0
- LeetCode: Binary Tree Inorder Traversal
- [LeetCode]Binary Tree Inorder Traversal
- LeetCode Binary Tree Inorder Traversal
- [Leetcode] Binary Tree Inorder Traversal
- Leetcode: Binary Tree Inorder Traversal
- LeetCode Binary Tree Inorder Traversal
- LeetCode : Binary Tree Inorder Traversal
- [Leetcode] Binary Tree Inorder Traversal
- 【leetcode】Binary Tree Inorder Traversal
- [LeetCode]Binary Tree Inorder Traversal
- Leetcode: Binary Tree Inorder Traversal
- [leetcode]Binary Tree Inorder Traversal
- LeetCode-Binary Tree Inorder Traversal
- Leetcode Binary Tree Inorder Traversal
- [leetcode] Binary Tree Inorder Traversal
- LeetCode - Binary Tree Inorder Traversal
- [LeetCode] Binary Tree Inorder Traversal
- LeetCode | Binary Tree Inorder Traversal
- Java之断点调试小记
- Ubuntu下QT安装Opencv库
- 链表笔记
- JAVA学习笔记(五十一)- DBUtil 封装数据库工具类
- maven学习笔记一
- [leetcode]Binary Tree Inorder Traversal
- 广播和多播
- CreateProcess 启动带参数的EXE 并获得PID
- MySQL 学习笔记(一)
- 关于autoreleasepool一个常见的面试题
- C++标准库string类型
- hdoj 1331 Function Run Fun 【记忆化搜索】
- 请求转发域重定向之间的区别
- ZOJ 2100 seed