3.31
没毛病。老铁
/**
* Definition of TreeNode:
* public class TreeNode {
* public int val;
* public TreeNode left, right;
* public TreeNode(int val) {
* this.val = val;
* this.left = this.right = null;
* }
* }
*/
public class Solution {
/**
* @param root: The root of binary tree.
* @return: Preorder in ArrayList which contains node values.
*/
public ArrayList<Integer> inorderTraversal(TreeNode root) {
ArrayList<Integer> list = new ArrayList<Integer>();
LinkedList<TreeNode> s = new LinkedList<TreeNode>();
if(root == null){
return list;
}// write your code here
TreeNode bt = root;
while( bt != null || !s.isEmpty()){
while( bt != null){
s.push(bt);
bt = bt.left;
}
if( !s.isEmpty()){
bt = s.pop();
list.add(bt.val);
bt = bt.right;
}
}
return list;
}
}