package com.wsq.tree;
import java.util.ArrayList;
import java.util.Deque;
import java.util.LinkedList;
import java.util.List;
public class InorderTraversal {
public List<Integer> inorderTraversal(TreeNode root) {
List<Integer> ans = new ArrayList();
Deque<TreeNode> stack = new LinkedList();
TreeNode pre = null;
TreeNode curr = root;
while(curr != null || !stack.isEmpty()){
while(curr != null){
stack.push(curr);
curr = curr.left;
}
curr = stack.pop();
ans.add(curr.val);
curr = curr.right;
}
return ans;
}
}
Processed:
0.014, SQL:
8
