Question: Write a C program to create a binary search tree tree in BFS manner )User will enter nodes of binary search i Binary search tree will be maintained after removal of selected level nodes in right subtree is greater than parent node. The left and right subtree each must Create a function to remove selected level of nodes from binary search tree (Binary search tree is a binary tree in which nodes in left subtree is smaller than parent node also be a binary search tree.) For example: In below tree after deletion of level 1, tree should change as mentioned 6->NULL 3 8 after deleting level 1 nodes