5_2\ Draw the binary search tree that would result from the insertion of the following integer keys: 14   58   18    10    99   52     33    69     47     17.

#ifndef BT_NODE_H#define BT_NODE_H struct btNode{   int data;   btNode* left;   btNode* right;}; // pre:  bst_root is root pointer of a binary search tree (may be 0 for//       empty tree) and portArray has the base address of an array large//       enough to hold all the data items in the binary search tree// post: The binary search tree has been traversed in-order and the data//       values are written (as they are encountered) to portArray in//       increasing positional order starting from the first elementvoid portToArrayInOrder(btNode* bst_root, int* portArray);void portToArrayInOrderAux(btNode* bst_root, int* portArray, int& portIndex); // pre:  (none)// post: dynamic memory of all the nodes of the tree rooted at root has been//       freed up (returned back to heap/freestore) and the tree is now empty//       (root pointer contains the null address)void tree_clear(btNode*& root); // pre:  (none)// post: # of nodes contained in tree rooted at root is returnedint…

How does a balanced binary search tree improve upon the standard binary search tree in terms of operations and efficiency?

In Java,What is the maximum number of comparisons that a binary search function will make when searching for a value in a 2000-elements array?  why?What is the difference between a binary tree and a binary search tree?