题目内容
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?
confused what “{1,#,2,3}” means? > read more on how binary tree is serialized on OJ.
题目分析
二叉树的中序遍历,不让用递归。。。
/**
* 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> ans=new LinkedList<Integer>();
Stack<TreeNode> stack=new Stack<TreeNode>();
while(true){
while(root!=null)
{
stack.push(root);
root=root.left;
}
if(stack.isEmpty()) break;
TreeNode node=stack.pop();
ans.add(node.val);
root=node.right;
}
return ans;
}
}