## Interview Questions – Find the immediate lesser key than the given key in the binary search tree

Problem Given a balanced binary search tree and node element E from the tree, find the immediate lesser element K. In case when the K is not present then return -1. Example [1] Given below binary search tree If E = 20 then K = 15 If E = 25 then K = 20 If…