void printRange(BinaryNode* t, int k1, int k2) { if(t!=nullptr) { if( k1 element) printRange( t->left, k1, k2 );

if( k1 element && t ->element element; if( t->element right, k1, k2); } }

write the code in c++ language and screenshot of the result

5. [20 marks] (Binary search tree) Write a function printRange that takes as inputa binary search tree t and two keys, k1 and k2, which are ordered so that kl