Java中将嵌套方法链转换为递归：构建多叉树的深度优先策略

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

public class MyTreeNode {
    private int[][] grid;
    private List<MyTreeNode> children = new ArrayList<>();
    private MyTreeNode parent = null;

    public MyTreeNode(int[][] grid) {
        this.grid = grid;
    }

    public void addChild(MyTreeNode child) {
        child.setParent(this);
        this.children.add(child);
    }

    public void addChild(int[][] grid) {
        MyTreeNode newChild = new MyTreeNode(grid);
        this.addChild(newChild);
    }

    public void addChildren(List<MyTreeNode> children) {
        for (MyTreeNode t : children) {
            t.setParent(this);
        }
        this.children.addAll(children);
    }

    public List<MyTreeNode> getChildren() {
        return children;
    }

    public int[][] getGrid() {
        return grid;
    }

    public void setGrid(int[][] grid) {
        this.grid = grid;
    }

    private void setParent(MyTreeNode parent) {
        this.parent = parent;
    }

    public MyTreeNode getParent() {
        return parent;
    }
}

import java.util.Arrays;
import java.util.List;

public class TreeBuilder {

    private static void addChildren(MyTreeNode root) {
        root.addChildren(Arrays.asList(
                new MyTreeNode(new int[6][7]),
                new MyTreeNode(new int[6][7]),
                new MyTreeNode(new int[6][7]),
                new MyTreeNode(new int[6][7]),
                new MyTreeNode(new int[6][7]),
                new MyTreeNode(new int[6][7]),
                new MyTreeNode(new int[6][7])
        ));
    }

    public static void depth(MyTreeNode root, int n) {
        if (n <= 0) return; // 递归终止条件
        addChildren(root); // 为当前节点添加子节点
        for (MyTreeNode child : root.getChildren()) {
            depth(child, n - 1); // 递归调用，为每个子节点构建子树
        }
    }

    public static void main(String[] args) {
        MyTreeNode root = new MyTreeNode(new int[6][7]);
        int depth = 3;
        depth(root, depth);

        // 验证树的结构（可选）
        System.out.println("Tree built with depth: " + depth);
        // You can add more validation code here to check the tree structure
    }
}