Write a program that is capable of creating a binary tree starting from the root node using structures and dynamic memory allocation. Ensure that the tree constructed is binary. Once the user creates...

Write a program that is capable of creating a binary tree starting from
the root node using structures and dynamic memory allocation. Ensure
that the tree constructed is binary. Once the user creates the binary tree

at run-time, your program should also check if the binary tree is a binary-
search tree or not. If not, it should output the node at the minimum depth

from the root which violates the condition for a binary search tree.
Input: The code initially asks for the root node and then dynamically
creates a binary tree with non-negative integer values until the user is
done.
Output: The output should be a single string displaying ‘YES’ or ‘NO’
accordingly if the tree entered is binary search tree or not. If not, it should

1

display: x node at i depth violates the BST condition
Example: One way to do is to ask for the root node to begin with, then
keep asking for a left/right child; followed by a prompt which shows a
current root value and asks for its subsequent children and so on. Two
special characters, say ! and * can be used to denote that the user is
not interested in child node values for the current node and end of the
tree respectively. In this way, you create the binary tree, after which you
should code to check if it is a binary search tree or not and display the
output.(You are free to implement in any way you please). Write using c Progamming Language.