13. N nodes
You have a binary search tree and integer n, find out the most efficient way to locate two nodes of the three whose summation is equaled to “n”?
You have a binary search tree and integer n, find out the most efficient way to locate two nodes of the three whose summation is equaled to “n”?