Write a c program ( not c++) to implement the functions of a binary tree. And display the results.

12 10 17 9 16 13 25 15 b. The core operations for binary trees include insertion of a node, search of a node in the above. Use your search function to search for nodes 16, 25, 9, and 22. Build a test c. Use breadth-first to traverse and display your tree. The breadth-first pseudocode is as tree, deletion of a node. Implement the 3 operations and use insert to create the tree in case for the delete function. provided below: if tree = nil: return Queue q q.Enqueue(tree) while not q.Empty(): node qDequeue() Print(node) if nodeleftnil: q.Enqueue(node.left) if node.right nil: q.Enqueue(node.right)