C visual studios Code Inorder Programming tree

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 inorder.

For clarity, display the tree showing as an indentation the depth of each node, like this:

2

3

4

5

7

9

10

11

In this example, the node '5' have two sons: 7 and 2. 4 is the only son of 4 and 9 is the only son

of 7.

Hint: For displaying, use a recursive function, passing as a parameter the current node's address

and the current node's depth. When calling recursively, pass the address of the next node (left

or right) and the current depth + 1. When displaying the current node's value, use a cycle for

displaying as many spaces as the current depth.

This code and screen of execution must be reported in a PDF file.