Question: Write a program that reads a BST, a node and a direction (Right or Left). Then, the program calculates number of nodes on the given direction of the given node.

Input specification: You will be two integers and a direction in the beginning,

• number of nodes (n) to be added to the BST,
• node to be searched in BST
• the direction: a string which can be only "Right" or "Left"

Output specification: If the searching number is in the BST, show the number of nodes in the given direction, show zero otherwise.