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 ...

A binary tree is a data structure consisting of a root node containing a value and linked to two child nodes, each of which can have two child nodes, and so on. Binary trees are used in various app ...

* array_to_bst - builds a Binary Search Tree from an array. * Return: pointer to the root node of the created BST, or NULL on failure.