|visits||member for||3 years|
|seen||May 29 '13 at 21:56|
Determining whether two binary search trees have the same set of values
does your solution really take O(n) space? Since they are both binary search trees if they have the same set of values they will be identical so you can do the inorder traversals in parallel and compare as you go just needing O(1) space unless I am missing something...