(Solved): In C programing language: Binary Trees Write a recursive function called prune() that takes the roo ...

Binary Trees Write a recursive function called prune() that takes the root of a binary tree and deletes all leaf nodes from the tree. Be sure to update any pointers that need to be updated to account for deleted nodes, carefully avoid any potential segmentation faults, and avoid memory leaks. (You may assume all the nodes in the tree have been dynamically allocated.) For example, For ' This function should return NULL if the root it receives gets deleted. Otherwise, it should return the root itself. Note that if the root is NULL, the function should simply return NULL without taking any further action. You cannot write any helper functions for this problem. All your work must be contained in a single function called prune(). The node struct definition and function signature are as follows: typedef struct node \{ int data; struct node *left; struct node *right; \} node; node *prune(node *root) \{ -..--FILL YOUR ANSWER HERE-