Q14

Insert the following keys one by one into a binary search tree in the order specified.

Show the final binary search tree after the insertions.

Draw the binary search tree after deleting $15$ from it.

Complete the statements $S1$, $S2$ and $S3$ in the following function so that the function computes the depth of a binary tree rooted at $t$. typedef struct tnode{ int key; struct tnode *left, *right; } *Tree; int depth (Tree t) { int x, y; if (t == NULL) return 0; x = depth (t -> left); S1: ___________; S2: if (x > y) return __________; S3: else return _______; }