[吊打面试官-力扣经典题]力扣-144二叉树前序遍历

CSDN的各位uu们你们好,千泽今天汇总了一下力扣上的二叉树相关的基础题,
接下来,让我们一起来刷题吧!

144. 二叉树的前序遍历 - 力扣（LeetCode）

题解代码

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public List<Integer> preorderTraversal(TreeNode root) {
           List<Integer> list =  new ArrayList<>();
          pre(root,list);
          return list;
     }

     public void pre(TreeNode root , List<Integer> list){
         if(root != null){
             list.add(root.val);                       
           pre(root.left, list);
           pre(root.right,list);
         }
     }
}