Microsoft interview question
Remove duplicates from an unsorted binary tree
Interview Answer
Anonymous
1 Nov 2019
Implemented a separate remove function that swapped till the node was a leaf, and destroyed it. Used a hash map to detect duplicates.
Remove duplicates from an unsorted binary tree
Anonymous
Implemented a separate remove function that swapped till the node was a leaf, and destroyed it. Used a hash map to detect duplicates.
Check out your Company Bowl for anonymous work chats.