非递归实现二叉树中序遍历
class BinaryTreeInorderSolution2{
public List<Integer> inorderTraversal(TreeNode root) {
List<Integer> list = new ArrayList<Integer>();
Stack<TreeNode> stack = new Stack<TreeNode>();
TreeNode curr = root;
while(curr!=null||!stack.isEmpty()) {
while(curr!=null) {
stack.push(curr);
curr=curr.left;
}
curr=stack.pop();
list.add(curr.val);
curr=curr.right;
}
return list;
}
}