Write a function that creates a binary search tree from elements in a given sequence. Function must return the pointer back to root of tree. Please explain the code.

TNODEPTR makeBST (int sequence[], int n)

// n = number of elements

Binary tree root.

struct node

{

}

int info;

struct tnode *left, *right;

typedef struct node *TNODEPTR;