解法1 - 递归
class Solution {
public List<Integer> preorderTraversal(TreeNode root) {
List<Integer> list = new ArrayList<>();
preorder(list,root);
return list;
}
private void preorder(List<Integer> list, TreeNode node) {
if (node == null) return;
list.add(node.val);
preorder(list, node.left);
preorder(list, node.right);
}
}
解法2 - 非递归
class Solution {
public List<Integer> preorderTraversal(TreeNode root) {
List<Integer> list = new ArrayList<>();
if (root == null) return list;
Stack<TreeNode>stack = new Stack<>();
stack.push(root);
while (root != null || !stack.isEmpty()) {
if (root != null) {
list.add(root.val);
stack.push(root);
root = root.left;
} else {
TreeNode node = stack.pop();
root = node.right;
}
}
return list;
}
}