Go binary search tree

tags

Go Programming Software Engineering

Requirements#

• Sorted array of lenght N

Performance#

• Say an array contains N (search space o N) elements, and we divide N/2, getting a search space of N/2, how many steps do we need until we get down to just one an array of 1 element.
• O(log2 n) problem.

Implementation#

• Can be implemented recursively or non-recursively.
• An array of N elements.

Code#