26Binary_Search_Tree_info.c

int main(int argc, char const *argv[])
{
/* 
Binary_Search_Tree
In binary Search Tree,all the left subtree elements should be less than root data and all the right subtree elements should be greater than root data.This is called binary search tree property..

This property should be satisfied at every node in the tree.


BASIC STRUCTURE OF BINARY SEARCH TREE
*/
struct BST_node 
{
	int data;
	struct BST_node *left;
	struct BST_node *right;
};



	return 0;
}