最近在LeetCode刷题,发现遇到不少二叉树类型的题目,题目会定义好树节点TreeNode的数据结构。
写一个数组转换成二叉树的工具
package text;
import java.util.LinkedList;
import java.util.Queue;
public class TreeNodeUtil {
public static TreeNode arrayToTreeNode(Integer[] array) {
if (array.length == 0) {
return null;
}
TreeNode root = new TreeNode(array[0]);
Queue<TreeNode> queue = new LinkedList<>();
queue.add(root);
boolean isLeft = true;
for (int i = 1; i < array.length; i++) {
TreeNode node = queue.peek();
if (isLeft) {
if (array[i] != null) {
node.left = new TreeNode(array[i]);
queue.offer(node.left);
}
isLeft = false;
} else {
if (array[i] != null) {
node.right = new TreeNode(array[i]);
queue.offer(node.right);
}
queue.poll();
isLeft = true;
}
}
return root;
}
}