Write a c program ( not c++) that will implement the functions of a binary tree, and display the results.

The core opatiuns fur binar Programing and also left info 10 index 9 12 1 6 10 72 Use breadth-first to traverse and display your tree. The breadth-first pseudocode provided below: if tree = nil: return Queue q q.Enqueue(tree) while not q.Empty): node qDequeue() Print(node) if node-left nil: q.Enqueue(node.left) if node.right nil: q.Enqueue(node.right)