coding-interview-6-595.pdf - 239 Convert Sorted Array to Binary Search Tree Given an array where elements are sorted in ascending order convert it to a

# coding-interview-6-595.pdf - 239 Convert Sorted Array to...

This preview shows page 1 out of 1 page.

239 Convert Sorted Array to Binary Search Tree Given an array where elements are sorted in ascending order, convert it to a height balanced BST. 239.1 Java Solution A typical DFS problem using recursion. // Definition for binary tree class TreeNode { int val; TreeNode left; TreeNode right; TreeNode( int x) { val = x; } } public class Solution { public TreeNode sortedArrayToBST( int [] num) { if (num.length == 0) return null

#### You've reached the end of your free preview.

Want to read the whole page?

• Fall '12
• KORB
• TreeNode, public class Solution

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern