So here I am, solving a few problems on Trees. And I stumbled upon this problem: Two Sum IV - Input is a BST. One approach can be to travel the nodes and hash the data in a set() and alongside check if the target-x (where x is the current node) is t...
Markdown supported · ⌘↵ to post
No responses yet.