Implement algorithm TreeInsert(x, k). Use the algorithm to insert the following values into an initially empty tree. 16, 5, 18, 2, 15, 17, 19, 1, 3, 13, 12, 14. Print the tree using an Inorder traversal. (In Java Programming)

Insertion

Node TreeInsert(x, k)

if (x == NULL) Create new node t with key k elseif (k < x.Key) x.Left TreeInsert(x.Left, k) elseif (k > x.Key) x.Right TreeInsert(x.Right, k) else Throw exception Existing key! return t