LeetCode 94. Binary Tree Inorder Traversal
来源:互联网 发布:vb控制plc 编辑:程序博客网 时间:2024/05/14 09:27
Given a binary tree, return the inorder traversal of its nodes' values.
Note: Recursive solution is trivial, could you do it iteratively?
二叉树的中序遍历的非递归算法,用栈可以实现,好像以前算法课的书上有这个算法,不过已经忘记差不多了...查阅后实现代码如下:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public List<Integer> inorderTraversal(TreeNode root) {
List<Integer> list = new ArrayList<>();
if (root == null)
return list;
Stack<TreeNode> s = new Stack<TreeNode>();
TreeNode p = root;
while (p != null || !s.empty()){
while (p != null){
s.add(p);
p = p.left;
}
p = s.pop();
list.add(p.val);
p = p.right;
}
return list;
}
}
只不过效率很不好2333,看评论区还有其他实现方法都很精巧,也算学习了
- LeetCode 94. Binary Tree Inorder Traversal
- [LeetCode]94.Binary Tree Inorder Traversal
- 94. Binary Tree Inorder Traversal Leetcode Python
- [Leetcode] 94. Binary Tree Inorder Traversal
- LeetCode --- 94. Binary Tree Inorder Traversal
- LeetCode 94. Binary Tree Inorder Traversal
- [leetcode] 94.Binary Tree Inorder Traversal
- 94. Binary Tree Inorder Traversal LeetCode
- LeetCode 94. Binary Tree Inorder Traversal
- *LeetCode 94. Binary Tree Inorder Traversal
- [LeetCode]94. Binary Tree Inorder Traversal
- [LeetCode]94. Binary Tree Inorder Traversal
- 【LeetCode】94. Binary Tree Inorder Traversal
- leetcode 94. Binary Tree Inorder Traversal
- leetcode 94. Binary Tree Inorder Traversal
- LeetCode *** 94. Binary Tree Inorder Traversal
- LeetCode-94.Binary Tree Inorder Traversal
- LeetCode 94. Binary Tree Inorder Traversal
- ZJOI2017 NGU!
- win7系统
- c++远征之继承篇
- 通过 xshell 连接 ubuntu on windows(WSL)
- 23种设计模式分析(5):行为型模式
- LeetCode 94. Binary Tree Inorder Traversal
- 2017年3月24日,周结(五),学生信息管理系统继续改进以及一些框架的使用
- 让UIWebView实现UIScrollerView的代理方法
- UE4 BP爬坑手记1
- 火狐浏览器打开时会自动打开毒霸网址大全
- 虚拟机(Linux)和物理机实现文件共享
- FFT黑科技(拆系数FFT)
- 一个BIO块设备驱动例子
- U盘如何加密