Book: Cracking the Coding Interview
Question: 4.3 (page 86)
Given a sorted (increasing order) array, write an algorithm to create a binary search tree with minimal height.
Solution: Complexity - O(n)
Book: Cracking the Coding Interview
Question: 4.3 (page 86)
Given a sorted (increasing order) array, write an algorithm to create a binary search tree with minimal height.
Solution: Complexity - O(n)
No comments:
Post a Comment