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;
}
public static TreeNode cjdefin(Object [] arrs){
return cjdefin(arrs, 0);
}
public static TreeNode cjdefin(Object [] arrs,Integer start){
if (start > arrs.length - 1 || arrs[start] == null ){
return null;
}
TreeNode treeNode = new TreeNode(Integer.parseInt(arrs[start] + ""));
treeNode.left = cjdefin(arrs,(start + 1) * 2 -1);
treeNode.right = cjdefin(arrs,(start + 1) * 2);
return treeNode;
}
}
测试
Object [] arrs = {3,9,20,null,null,15,7};
TreeNode cjdefin = TreeNode.cjdefin(arrs);
![在这里插入图片描述](https://img-blog.csdnimg.cn/7a466a5a70f34549b1b7c2cc77fdc1eb.png)