News
root.left=buildTree(Arrays.copyOfRange(inorder,0,i),Arrays.copyOfRange(postorder,0,i)); root.right=buildTree(Arrays.copyOfRange(inorder,i+1,inorder.length),Arrays ...
public TreeNode build(int[] inorder, int inS, int inE, int[] postorder, int posS, int posE){ ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback