In previous weeks, you have seen how to create linked lists and circular linked lists. Now, you will learn another struc

[answerhappygod]

In previous weeks, you have seen how to create linked lists and
circular linked lists. Now, you will learn another structure called
binary trees. we are not going to explain its advantages and
disadvantages, but we will see some functions such as get the
minimum and maximum number of the binary tree. The image
below shows an example of the structure of binary trees. A binary
tree is a -- Number group of nodes (as linked list). The difference
is that binary tree’s node has 4 features: Previous nodeRightChild
(Next node on the right)LeftChild (Next node on the left) One
condition of binary tree is that the RightChild node is greater and
eq the LeftChild node is smaller than the previous node. In this
task, you will create a binary tree. Then, you will call functions
ual to the previous node, and whose arguments is only the structure
( pointer ) to get the maximum and minimum numbers. The user
will give you the following information:-- The number of elements
the binary three will have and The elements of the binary tree You
consider that the first input is the head of the binary tree You
will need to use the followin • • Stdlib.h Malloc g libraries and
functions: You wil l get 3 pts per function. This is to be in C