Write a code in C$++$:

Given a Binary Search Tree and two values k$1$ and k$2,$ write a function

to print all values in the tree that lie in the range k$1$ to k$2.$ The values should be printed in increasing order. A prototype of the function is given below.

printRange$($node root, int k$1,$ int k$2)\{...\}$