Leetcode skimming: binary tree 02 (middle order traversal of binary tree)

94. Middle order traversal of binary trees

Force button topic link

package com.programmercarl.tree;

import java.util.ArrayList;
import java.util.List;

/** * @ClassName InorderTraversal * @Descriotion TODO * @Author nitaotao * @Date 2022/7/1 15:32 * @Version 1.0 * https://leetcode.cn/problems/binary-tree-inorder-traversal/ * 94.  Middle order traversal of binary trees  **/
public class InorderTraversal {
    
    public List<Integer> inorderTraversal(TreeNode root) {
    
        List<Integer> result = new ArrayList<Integer>();
        traversal(root, result);
        return result;
    }

    /** *  In the sequence traversal  * @param root * @param result */
    public void traversal(TreeNode root, List<Integer> result) {
    
        if(root==null) {
    
            return;
        }
        // Left middle right 
        traversal(root.left, result);
        result.add(root.val);
        traversal(root.right, result);
    }
}