please help in C, NOT in thr C++

2] Build, in any language, a linked binary tree for integers. a) The tree should be ordered all the time. b) It should accept new numbers and insert them where they should be. c) The linked tree should be displayed when a change (insertion) occurs. d) The traversal for displaying the tree must be pre-order. For clarity, display the tree showing as an indentation the depth of each node, like this: In this example, the node ' 5 ' have two sons: 7 and 2.4 is the only son of 4 and 9 is the only s of 7