根据二维数组创建二叉树Java
在LeetCode刷题的时候,遇到二叉树的题目,想要自己在Idea上调试,发现不会创建二叉树。查了资料后,记录一下,根据二维数组递归创建二叉树。
/**
* 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;
* }
* }
*/
public TreeNode createBTree(int[] array, int index) {
TreeNode tn = null;
if (index < array.length) {
int value = array