LeetCode Binary Tree Inorder Traversal

Given a binary tree, return the inorder traversal of its nodes' values.

For example:
Given binary tree {1,#,2,3},

   1\2/3

return [1,3,2].

Note: Recursive solution is trivial, could you do it iteratively?

代码如下：

class TreeNode
{int val;TreeNode left;TreeNode right;TreeNode(int x) { val = x; }
}
class Solution
{public List<Integer> inorderTraversal(TreeNode root){Stack<TreeNode> stack = new Stack<TreeNode>();TreeNode current = root;List<Integer> ret = new ArrayList<Integer>();while (current != null || !stack.empty()){while (current != null){stack.push(current);current = current.left;}if (!stack.empty()){TreeNode tmp = stack.pop();ret.add(tmp.val);current = tmp.right;}}return ret;}
}

LeetCode Binary Tree Inorder Traversal相关推荐

[leetcode]Binary Tree Inorder Traversal
二叉树的中序遍历非递归版本,采用的是wiki百科上的办法.果然简洁,而且和先序有异曲同工之妙,先序只用push右节点,中序只用push中节点.除此之外还有个更改TreeNode加一个visited的b ...
Leetcode: Binary Tree Inorder Traversal
中序遍历代码: #include <iostream> #include <vector> using namespace std;struct TreeNode {int ...
【二叉树迭代版中序遍历】LeetCode 94. Binary Tree Inorder Traversal
LeetCode 94. Binary Tree Inorder Traversal Solution1:递归版二叉树的中序遍历递归版是很简单的,中序遍历的迭代版需要特殊记一下! 迭代版链接:htt ...
LeetCode 94. Binary Tree Inorder Traversal
94. Binary Tree Inorder Traversal Given a binary tree, return the inorder traversal of its nodes' va ...
[LeetCode] Binary Tree Postorder Traversal 二叉树的后序遍历
Given a binary tree, return the postorder traversal of its nodes' values. For example: Given binary ...
15 二叉树的中序遍历（Binary Tree Inorder Traversal）
文章目录 1 题目 2 描述 3 解决方案 3.1 递归算法 3.1.1 遍历法(Traverse) 思路源码 3.1.2 分治法(Devide And Conquer) 思路源码 3.2 非递归 ...
[LeetCode]:94:Binary Tree Inorder Traversal
题目: Given a binary tree, return the inorder traversal of its nodes' values. For example: Given binar ...
leetcode[94]Binary Tree Inorder Traversal
Given a binary tree, return the inorder traversal of its nodes' values. For example: Given binary tr ...
[swift] LeetCode 94. Binary Tree Inorder Traversal
Given a binary tree, return the inorder traversal of its nodes' values. For example: Given binary tr ...

LeetCode Binary Tree Inorder Traversal

LeetCode Binary Tree Inorder Traversal相关推荐

最新文章

热门文章