LeetCode-94-二叉树的中序遍历

  题目详情

解题思路

 1.  递归解决，简单没烦恼

/**
 * 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> inorderTraversal(TreeNode root) {
        List<Integer> result=new ArrayList<>();
        if(root==null){
            return result;
        }
        
        List<Integer> leftChild=inorderTraversal(root.left);
        result.addAll(leftChild);
        
        result.add(root.val);

        List<Integer> rightChild=inorderTraversal(root.right);
        result.addAll(rightChild);
        
        return result;
       
    }
}