package leetcode;
/*Given a binary tree, return the preorder traversal of its nodes' values
*/
import java.util.ArrayList;
public class Binary_tree_preorder_traversal {
public static void main(String[] args) {
}
public ArrayList<Integer> preorderTraversal(TreeNode root) {
ArrayList<Integer> al = new ArrayList<>();
if(root == null)
return al;
al.add(root.val);
al.addAll(preorderTraversal(root.left));
al.addAll(preorderTraversal(root.right));
return al;
}
}