144. Binary Tree Preorder Traversal | 前序遍历
/**
* 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> preorderTraversal(TreeNode root) {
List<Integer> res = new ArrayList<>();
Stack<TreeNode> s = new Stack<>();
while(!s.isEmpty() || root!=null) {
if(root!=null) {
res.add(root.val);
s.push(root);
root = root.left;
}
else {
root = s.pop();
root = root.right;
}
}
return res;
}
}