python

Write the function quickBST(L) that receives a list L and builds and returns a binary search tree with the elements of L without using the insert operation. Your function must work as follows: quickBST(L) if L is empty, return an empty BST Create a node T containing L[] as the key Let L left be the list containing the elements of L that are less than L[] Let L _right be the list containing the elements of L that are greater than L[] Let the left child of T be the BST obtained by calling quickBST (L_left) Let the right child of T be the BST obtained by calling quickBST(L_right) return T