递归过于简单这里给出迭代
public List<Integer> inorderTraversal(TreeNode root) {
List<Integer>result=new ArrayList<>();
Stack<TreeNode>stack=new Stack<>();
TreeNode node=root;
while(node!=null||!stack.isEmpty()){
while(node!=null){
stack.push(node);
node=node.left;
}
node=stack.pop();
result.add(node.val);
node=node.right;
}
return result;
}
网友评论