Commit cb8c39e

committed

update 1008.construct-binary-search-tree-from-preorder-traversal.java

1 parent 8fbba58 commit cb8c39eCopy full SHA for cb8c39e

File tree

-6

lines changed

-6

lines changed

Lines changed: 2 additions & 6 deletions

Original file line number	Diff line number	Diff line change
`@@ -58,15 +58,11 @@ TreeNode callme(int[] arr, int start, int end){ // [start, end] both inclusive`
`58`	`58`	`if(start > end)`
`59`	`59`	`return null;`
`60`	`60`
`61`		`- TreeNode root = new TreeNode(arr[start]);`
`62`		`-`
`63`		`- if(start == end)`
`64`		`- return root;`
`65`		`-`
`66`	`61`	`int mid = start+1;`
`67`	`62`	`while(mid <= end && arr[mid] < arr[start])`
`68`	`63`	`mid++;`
`69`		`-`
	`64`	`+`
	`65`	`+ TreeNode root = new TreeNode(arr[start]);`
`70`	`66`	`root.left = callme(arr, start+1, mid-1);`
`71`	`67`	`root.right = callme(arr, mid, end);`
`72`	`68`

Comments

(0)