In c

Pranetree (p->right) 8. Implement an iterative C function DeleteBinarySearchTree () for deleting a 9. Implement a recursive C function PrintBinaryTreestructure() which shows 10. Implement a recursive function for CountNodes () counting the number of leaves in a value from a binary search tree. the structure of the binary tree. binary search tree. Hint: Modify your function PrintTree) to keep track on the number of nodes visited. 11. Implement a recursive function for CountLeaves() counting the number of leaves in a binary search tree. Hint: Modify your function PrintTree ) to also check whether or not a node is a leaf and to update the number of leaf nodes encountered. 12. Implement a recursive C function TreeHeight () for finding the height of a binary search tree. The height of a binary search tree is the length of the longest path from the root to a leaf. Hint: Modify your function PrintTree() to determine the height of each node's left and right subtree. 13. Implement a C function CopyTree that takes as input a binary tree and makes a 14. Two trees Ti and T2 are said to have the same structure if copy of the binary tree a) both trees are empty or b) the left and right subtrees, respectively, rooted at corresponding nodes u in Ti and and v in T2 have the same structure 15. Write a C function IdenticalTrees () which checks whether two trees are identical. Two trees are considered identical if (1) they have the same structure and (2) all the values stored in corresponding nodes are identica inserting a new value into a binary search tree. stack to keep track of the order in which nodes 16. Implement an iterative C function IterativeInserBinarySearchTree () for 17. Implement in order traversal of a binary search tree without using are visited for the first time in the tree