we covered binary tree and binary search tree. You are given a binary tree whose keys are integers. You need to test if this is a correct binary search tree. The rule is like this, the first number (first line) will show how many nodes there will be. The following lines will have 3 integers: the key of the node (keyi), the index of left child and (lefti) and the index of right child (righti). -1 means there is no child of the node.OUTPUT: If the given binary tree is a correct binary search tree, then it is a binary search tree will be printed. Otherwise, it is not a binary search tree will be printed. Use C language for writing your code

Output: it is chinar, andurh twan Example 2: Input: 3 511 7-1 2 911 Output: it is a binary search tree