DataType data; // An
object containing a key field for ordering TreeNode right; //
reference to the root node of the left subtree TreeNode left; //
reference to the root node of the right subtree }
Binary Search Tree Node
Example 1:Implementation:
Use dynamic memory allocation to create
nodes when required.