write A PROGRMME IN C LANGUAGE

8. (a) Develop a binary search tree resulting after inserting the following integer keys 49, 127, 12, 11, 38, 77, 126, 456, 123, 6. Show the modified tree after each deletion: *Delete 6 *Delete 77 Delete root *Delete 12 5 (b) Write functions in C for following operations on a binary search tree. i. Find a node (non-recursive) ii. Find the minimum and maximum elements of binary search tree. 2.5+2.5=5