FilesExpand file tree

 master

/

ConvertSortedArrayToBST.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

36 lines (29 loc) · 792 Bytes

 master

/

ConvertSortedArrayToBST.java

Copy path

Top

File metadata and controls

• Code
• Blame

36 lines (29 loc) · 792 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

package tree;

/**

* Created by gouthamvidyapradhan on 09/03/2017. Given an array where elements are sorted in

* ascending order, convert it to a height balanced BST.

*/

public class ConvertSortedArrayToBST {

public class TreeNode {

int val;

TreeNode left;

TreeNode right;

TreeNode(int x) {

val = x;

}

}

public TreeNode sortedArrayToBST(int[] nums) {

if (nums.length == 0) return null;

return build(0, nums.length - 1, nums);

}

private TreeNode build(int s, int e, int[] nums) {

if (s > e) return null;

int m = (e - s) / 2;

int node = nums[s + m];

TreeNode root = new TreeNode(node);

if (s == e) return root;

root.left = build(s, s + m - 1, nums);

root.right = build(s + m + 1, e, nums);

return root;

}

}