Binary Tree Inorder Traversal
来源:互联网 发布:未提交行1中的数据 编辑:程序博客网 时间:2024/06/03 18:54
/** * Definition for binary tree * 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> res = new ArrayList<Integer>(); if(null == root) return res; Stack<TreeNode> s = new Stack<TreeNode>(); while(!s.isEmpty()||null != root){ while(null != root){ s.push(root); root = root.left; } root = s.pop(); res.add(root.val); root = root.right; } return res; }}原理同前序遍历。
0 0
- Binary Tree Inorder Traversal
- Binary Tree Inorder Traversal
- Binary Tree Inorder Traversal
- Binary Tree Inorder Traversal
- Binary Tree Inorder Traversal
- Binary Tree Inorder Traversal
- Binary Tree Inorder Traversal
- Binary Tree Inorder Traversal
- Binary Tree Inorder Traversal
- Binary Tree Inorder Traversal
- Binary Tree Inorder Traversal
- Binary Tree Inorder Traversal
- Binary Tree Inorder Traversal
- Binary Tree Inorder Traversal
- Binary Tree Inorder Traversal
- Binary Tree Inorder Traversal
- Binary Tree Inorder Traversal
- Binary Tree Inorder Traversal
- atitit.避免NullPointerException 总结and 最佳实践 o99
- 国内ASP开源建站系统一览
- hdu 1114 Piggy-Bank
- OAuth认证原理
- 黑马程序员—OC—面向对象(二)
- Binary Tree Inorder Traversal
- Android中设定EditText的输入长度
- lua中打印所以类型功能实现table嵌套table
- ZOJ 3811 Untrusted Patrol 并查集
- C#中的值类型与引用类型
- iOS更换皮肤的思路与代码实现
- 黑马程序员—OC—类方法 && self
- 基于直方图均衡化的水下激光图像处理(MATLAB仿真)
- ZOJ1710