leetcode Binary Tree Inorder Traversal
来源:互联网 发布:网络配音培训班 编辑:程序博客网 时间:2024/06/05 21:10
题目链接
/** * 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) { Stack<TreeNode> myStack=new Stack<TreeNode>(); List<Integer> result=new LinkedList<Integer>(); if(root==null) { return result; } TreeNode temp=root; while(temp!=null) { myStack.push(temp); temp=temp.left; } while(!myStack.isEmpty()) { temp=myStack.pop(); result.add(temp.val); if(temp.right!=null) { temp=temp.right; while(temp!=null) { myStack.push(temp); temp=temp.left; } } } return result; }}
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
- centos kvm部署和常用命令
- Linux下gedit中文显示乱码
- 黑马程序员—集合框架共性方法与迭代器
- 第二阶段 软件测试管理概述
- 汉明距离
- leetcode Binary Tree Inorder Traversal
- hihocoder #1091
- 敏捷开发
- 图的遍历,非递归版本,深度优先遍历
- Myeclipse中设置maven以及maven项目的导入
- Web分页技术的思想汇集
- LIntCode-二进制求和
- php开发日记之数据库连接
- 今天面试了两个程序猿(二)