link: https://leetcode.com/problems/binary-tree-preorder-traversal/
Solution1: 使用递归
class Solution {
public void helper(TreeNode root, List<Integer> res) {
if(root != null) res.add(root.val);
if(root.left != null) helper(root.left, res);
if(root.right != null) helper(root.right, res);
}
public List<Integer> preorderTraversal(TreeNode root) {
List<Integer> res = new ArrayList<>();
if(root == null) return res;
helper(root, res);
return res;
}
}
TC: O()
Solution2: 使用迭代
class Solution {
public List<Integer> preorderTraversal(TreeNode root) {
List<Integer> res = new ArrayList<>();
Stack stack = new Stack();
if(root == null) return res;
while(root != null || !stack.empty()){
if(root == null) {
root = ((TreeNode)stack.pop()).right;
continue;
}
res.add(root.val);
stack.push(root);
root = root.left;
}
return res;
}
}