1. You are given a partially written BST class. 2. You are required to complete the body of pir function. "pir" function is expected to print all nodes between d1 and d2 (inclusive and in increasing order). 3. Input and Output is managed for you. Note -> Please watch the question video for clarity.
Input Format
Input is managed for you
Output Format
Output is managed for you
Constraints
None
Notice
Try First, Check Solution later
1. You should first read the question and watch the question video.2. Think of a solution approach, then try and submit the question on editor tab.3. We strongly advise you to watch the solution video for prescribed approach.Example
Input
21 50 25 12 n n 37 30 n n n 75 62 60 n n 70 n n 87 n n 12 65
Output
12 25 30 37 50 60 62