Create a node class$/$struct

$-$Data field

$-2$ self referential pointers

Create a BST class$/$struct

$-$Node field

Methods:

Add $($data$)$

$-$Adds the data to the tree in sorted order.

Print$()$

$-$Prints all the nodes using inorder traversal