class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode (int val) {
this.val=val;
}
}
//---------------------------------------------------------------------
public class TreeTest {
TreeNode root;
String[] partTree;
public String[] intialInput(String s) {
String s1=s.substring(1,s.length()-1);
partTree=s1.split(",");
return partTree;
}
public TreeNode createNode(TreeNode rot,int index) {
//传入root给rot后,由于rot会new一下,从而指向别的地方,
if(index>= partTree.length ) {
//从而root实际指向位置不变,所以返回值类型为TreeNode
return null;
}
if(partTree[index].equals("null") ) { //equals判断,而不是==
return null;
}
rot=new TreeNode(Integer.p