LeetCode(94,145,144)-二叉树的遍历方式-二叉树

 一、题目

94. 二叉树的中序遍历https://leetcode.cn/problems/binary-tree-inorder-traversal/

144. 二叉树的前序遍历https://leetcode.cn/problems/binary-tree-preorder-traversal/

145. 二叉树的后序遍历https://leetcode.cn/problems/binary-tree-postorder-traversal/

二、题解

方式一：递归

    /**
     * 二叉树前序遍历
     * 方式一：递归之前序遍历
     *
     * @param root
     * @return
     */
    public List<Integer> preorderTraversal(TreeNode root) {
        ArrayList<Integer> res = new ArrayList<>();
        preorder(root, res);
        return res;
    }

    public void preorder(TreeNode curr, List<Integer> list) {
        if (curr =&