In C:

Write a program to find the kth smallest element in a binary search tree. Since we don't know how many elements are in each subtree, we can add a new field count to each node that stores the total number of elements that are in the left subtree and the current node. You need the update count field of the nodes when you insert and delete from the tree. To find the kth smallest node, you need to use the count field of the current node and decide whether kth smallest node is in the left subtree or the right subtree and follow that subtree. Node structure with count field is as follows struct node { int key Int count; struct node *left, *right; }; typedef struct node node; Consider the binary search tree given below. Count field for a node is shown on top left of the node Sample execution for above tree is given below foxO1 greaterthan ass ign4 Enter the set of numbers for the tree 10 6 14 4 8 12 16 Enter k 5 Result =12