@@ -0,0 +1,778 @@
+/**%0A * Definition for a binary tree node.%0A * public class TreeNode %7B%0A *     int val;%0A *     TreeNode left;%0A *     TreeNode right;%0A *     TreeNode(int x) %7B val = x; %7D%0A * %7D%0A */%0Apublic class Solution %7B%0A    public List%3CInteger%3E inorderTraversal(TreeNode root) %7B%0A        List%3CInteger%3E result = new ArrayList%3CInteger%3E();%0A        Stack%3CTreeNode%3E st = new Stack%3CTreeNode%3E();%0A        if(root == null)%7B%0A            return result;%0A        %7D%0A        while(true)%7B%0A            while(root != null)%7B%0A                st.push(root);%0A                root = root.left;%0A            %7D%0A            if(st.empty())%7B%0A                break;%0A            %7Delse%7B%0A                result.add(st.peek().val);%0A                root = st.pop().right;%0A            %7D%0A        %7D%0A        return result;%0A        %0A    %7D%0A%7D

Q94 Binary Tree Inorder Traversal