leetcode144题二叉树的中序遍历

leetcode144题二叉树的中序遍历

题目：
给你二叉树的根节点 root ，返回它节点值的 前序 遍历。

/**
 * 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> ansList=new ArrayList<Integer>();
        preOrder(root,ansList);
        return ansList;
    }
    public void preOrder(TreeNode root,List<Integer> list)
    {
        if(root!=null)
        {
            list.add(root.val);
            preOrder(root.left,list);
            preOrder(root.right,list);
        }
    }
}

• 学习参考资料是代码随想录