题目:
Given a binary tree, return the inorder traversal of its nodes' values.
For example:
Given binary tree [1,null,2,3]
,
1 \ 2 / 3
return [1,3,2]
.
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; }
* }
*/
class Solution {
public List<Integer> inorderTraversal(TreeNode root) {
//给定二分查找树(左子树小于根节点,右子树大于根节点)
//思路:中序遍历实现访问整个树,最后输出不为空的节点
List<Integer> list=new ArrayList<>();
if(root==null){
return list;
}
Stack<TreeNode>stack=new Stack<TreeNode>();
while(root!=null||!stack.empty()){
if(root!=null){
stack.push(root);
root=root.left;
}else{
root=stack.pop();
list.add(root.val);
root=root.right;
}
}
return list;
}
}