最近一直在刷算法题。遇到比较棘手的问题,便是二叉树的测试用例如何构建。众所周知,力扣给的二叉树测试用例都是以满二叉树的数组形式表示的。
如果想要测试自己在idea上写得代码,一个一个构建节点,将会十分的麻烦,并且每道题都构建,会浪费大量时间。因此我自己写了这个构建测试用例的代码。经过我本人测试没有问题,但我也只是算法入门,如果代码存在问题,非常欢迎指出我的不足,谢谢!
下面是具体代码。
public static TreeNode treeNodeBuild(Integer[] res) {
Queue<TreeNode> nodes = new LinkedList<>();
Queue<TreeNode> children = new LinkedList<>();
TreeNode treeNode = new TreeNode();
if (res.length == 1) {
treeNode.val = res[0];
return treeNode;
}
for (int i = 0; i < res.length; i++) {
if (res[i] == null) {
nodes.add(null);
} else {
nodes.add(new TreeNode(res[i]));
}
}
while (nodes.size() != 0) {
if (children.size() == 0) {
treeNode = nodes.poll();
TreeNode child1 = nodes.poll();
TreeNode child2 = nodes.poll();
treeNode.left = child1;
treeNode.right = child2;
children.add(child1);
children.add(child2);
} else {
TreeNode n = children.poll();
TreeNode left = nodes.poll();
TreeNode right = nodes.poll();
n.left = left;
n.right = right;
children.add(left);
children.add(right);
}
}
return treeNode;
}
二叉树类
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;
}
}