I just need the code of this word problem that has three parts. Please be sure about your answer!!

Node in a BST/ struct TreeNode f int key struct TreeNode left; /* pointer to left child */ struct TreeNode right; /* pointer to right child * di Node in a linked list* struct ListNode ( int key; struct ListNode next; /* pointer to the neat item in a list/ typedef struct TreeNode TreeNodePtr; typedef struct ListNode ListNodePtr STORE THE BODIES OF THE NEXT FUNCTIONS IN FILE bst.c/ /*createBSTnode allocates a node of type TreeNode and initializes it with key and left-right-NULL. createBSTnode returns a pointer to this node. If memory cannot be allocated, NULL is returned. */ TreeNodePtr createBSTnode (int key); /*insertNodeIntoBST inserts a node into a BST. root points to the root of the tree and z points to a node to be inserted. insertNodeIntoBST returns a pointer to the root of the tree (with % serted). */