Convert-Sorted-Array-to-Binary-Search-Tree Given an integer array nums where the elements are sorted in ascending order, convert it to a height-balanced binary search tree.

* array_to_avl - Builds an AVL tree from an array. * @array: A pointer to the first element of the array to be converted. * @size: The number of elements in @array. * Return: A pointer to the root ...

Both a sorted array and a binary tree can let you look up an element in log (N) time. However I would expect a sorted array to be faster in practice because of the constant factor. However ...