/**
* 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<>();
Stack<TreeNode> stack = new Stack<>();
while (root!=null||!stack.empty()){
while (root!=null){
stack.push(root);
root = root.left;
}
if(!stack.empty()){
TreeNode top = stack.pop();
list.add(top.val);
root = top.right;
}
}
return list;
}
}