Write a c code, binary search tree and solve the question according to the explanations

In this project, you will construct at with the stars the given out file. The st has the following properties es notes are distributed to dete provides the best possible totale student in memesam! You will develop an with that made the prominute and in the key to the BST with the properties as defined After coming the your program will print the depth level of the stand the number of rodes in each other wey may be searched for in the IST if the key is in the tist, the programs with the level and the dance to the lett most node, otherwise the output will be the following the day is not in the tree The should have the motive and cold boys you have to control the ingut file of put file contains and negative is the thermogram produces an emer The name of the input le must be .Det beat the same directory with your source code won't check the path and the name of the When the path or sorteile is not found, I will not eat your des The input file contains strictly pesticing tegese with celine. An sample follow 1055709711520921521213278 Out Dethle+ Det Keralar to be the new A Depth level them Depth levels, demont Gehed A Depth the A Depth wel 1. Inheem A Day level. Indien to be the El In this project, you will construct at with the stars the given out file. The st has the following properties es notes are distributed to dete provides the best possible totale student in memesam! You will develop an with that made the prominute and in the key to the BST with the properties as defined After coming the your program will print the depth level of the stand the number of rodes in each other wey may be searched for in the IST if the key is in the tist, the programs with the level and the dance to the lett most node, otherwise the output will be the following the day is not in the tree The should have the motive and cold boys you have to control the ingut file of put file contains and negative is the thermogram produces an emer The name of the input le must be .Det beat the same directory with your source code won't check the path and the name of the When the path or sorteile is not found, I will not eat your des The input file contains strictly pesticing tegese with celine. An sample follow 1055709711520921521213278 Out Dethle+ Det Keralar to be the new A Depth level them Depth levels, demont Gehed A Depth the A Depth wel 1. Inheem A Day level. Indien to be the El In this project, you will construct a Twith the keys that are the peningut. The BST has the following properties Its nodes are distributed over los depth level . it provides the best possible total times that we intercam You will develop an wigorithm that read the best at file and inserts the keys to the St with the properties as defined above. After constructing the your program will print the depth level of the ST, and the number of rodes in each depth any key may be searched for in the BST the key in the US, the program's out will be the truth leveled the distance to the leftmost node, otherwise the output will be the following the key is not in the tree." The ST should have at least 16 native and not replicated, you have to control the input file input file contains less and/or neste bythen the program produces an error message . The name of the input file must be intet and it should be the same directory with your source code won't check the path and the name of your input file when run your program the path or source file is not found, I will not evaluate your code: The input file contains strictly positive, excluding seated with ace in a line. An ample follows: 105 325 7097 195 2056 21521216581278 Out Depth of Del At Depth levelseth element Key to be add to At Depth level themalt 24 Detva Devel, ehement At Depth levelsenent At Depth level 1. 2nd clamant Key to be the e not found in BST Key was the In this project, you will construct at with the stars the given out file. The st has the following properties es notes are distributed to dete provides the best possible totale student in memesam! You will develop an with that made the prominute and in the key to the BST with the properties as defined After coming the your program will print the depth level of the stand the number of rodes in each other wey may be searched for in the IST if the key is in the tist, the programs with the level and the dance to the lett most node, otherwise the output will be the following the day is not in the tree The should have the motive and cold boys you have to control the ingut file of put file contains and negative is the thermogram produces an emer The name of the input le must be .Det beat the same directory with your source code won't check the path and the name of the When the path or sorteile is not found, I will not eat your des The input file contains strictly pesticing tegese with celine. An sample follow 1055709711520921521213278 Out Dethle+ Det Keralar to be the new A Depth level them Depth levels, demont Gehed A Depth the A Depth wel 1. Inheem A Day level. Indien to be the El In this project, you will construct at with the stars the given out file. The st has the following properties es notes are distributed to dete provides the best possible totale student in memesam! You will develop an with that made the prominute and in the key to the BST with the properties as defined After coming the your program will print the depth level of the stand the number of rodes in each other wey may be searched for in the IST if the key is in the tist, the programs with the level and the dance to the lett most node, otherwise the output will be the following the day is not in the tree The should have the motive and cold boys you have to control the ingut file of put file contains and negative is the thermogram produces an emer The name of the input le must be .Det beat the same directory with your source code won't check the path and the name of the When the path or sorteile is not found, I will not eat your des The input file contains strictly pesticing tegese with celine. An sample follow 1055709711520921521213278 Out Dethle+ Det Keralar to be the new A Depth level them Depth levels, demont Gehed A Depth the A Depth wel 1. Inheem A Day level. Indien to be the El In this project, you will construct a Twith the keys that are the peningut. The BST has the following properties Its nodes are distributed over los depth level . it provides the best possible total times that we intercam You will develop an wigorithm that read the best at file and inserts the keys to the St with the properties as defined above. After constructing the your program will print the depth level of the ST, and the number of rodes in each depth any key may be searched for in the BST the key in the US, the program's out will be the truth leveled the distance to the leftmost node, otherwise the output will be the following the key is not in the tree." The ST should have at least 16 native and not replicated, you have to control the input file input file contains less and/or neste bythen the program produces an error message . The name of the input file must be intet and it should be the same directory with your source code won't check the path and the name of your input file when run your program the path or source file is not found, I will not evaluate your code: The input file contains strictly positive, excluding seated with ace in a line. An ample follows: 105 325 7097 195 2056 21521216581278 Out Depth of Del At Depth levelseth element Key to be add to At Depth level themalt 24 Detva Devel, ehement At Depth levelsenent At Depth level 1. 2nd clamant Key to be the e not found in BST Key was the