# Introduction In computer science, a binary search tree (BST) is a binary tree data structure in which each node has at most two children, which are referred to as the left child and the right child. A binary search tree is a binary tree where the value of each node is greater than or equal to the values in its left subtree and less than or equal to the values in its right subtree. The height of a binary search tree is the number of edges between the tree's root and its furthest leaf. In this challenge, we will create a binary search tree with minimal height from a sorted array.

Click the virtual machine below to start practicing