BST/bst_codeschool.cpp
// in order traversal results in sorted order node->data
in order traversal results in sorted order node->data
in order traversal results in sorted order node - > data
void inorder_traversal_bst(BstNode *root)
{
	if (root)
	{
		inorder_traversal_bst(root->left);
		cout << root->data << " ";
		inorder_traversal_bst(root->right);
	}
}
void inorder_traversal_bst ( BstNode * root ) { if ( root ) { inorder_traversal_bst ( root -> left ) ; cout << root -> data << " " ; inorder_traversal_bst ( root -> right ) ; } }
in order traversal results in sorted order node->data
in order traversal results in sorted order node - > data