LeetCode
Experience
·
Oct 2019
·
Paris
Google | Phone screen | Common Elements of Two Separate BSTs
7 upvotes
2,157 views
9 replies
Interview Experience
Hello, I intervewed for Google Paris, the question was: Find all common elements in two integer BSTs. I used two DFTs for the solution, the first one adds the elements of one tree...
Full Details
🔒
Unlock full leaked content
Full insider details, leaked discussions, and candidate experiences.
Get Premium →Topics
Binary Tree