92.BinaryTreeInorderTraversal

Question: Given a binary tree, return the inorder traversal of its nodes' values.

public List<Integer> inorderTraversal(TreeNode root) {

<pre name="code" class="java" style="color: rgb(51, 51, 51); line-height: 30px;"><span style="white-space:pre"></span>List<Integer> res = new ArrayList<Integer> ();

<span style="white-space:pre"></span>Stack<TreeNode> st = new Stack<TreeNode> ();    <span style="white-space:pre"></span>TreeNode cur = root;

<span style="white-space:pre"></span>while(cur!=null || !st.empty()){        if(cur!=null){            st.push(cur);            cur = cur.left;        }else{            cur = st.pop();            res.add(cur.val);            cur = cur.right;        }    }    return res;}