A partial implementation of a Binary Search Tree class is givenbelow. Add a public member function to this class that returns thesmallest value in the tree. You may add private helper functions ifthat makes your solution easier.
So i’m currently confused, I know the BST stores a pair whichconsists of the key and value but i have no idea how to return thesmallest value. Since this is being organized by the key thenwouldn’t it be possible for the values associated with the key berandomly sorted? (i.e <key, value> (a, 15) (b, 10)) ioriginally did it by iterating through the nodes until
PayPal Gateway not configured
PayPal Gateway not configured