Amazon Interview Question
Shortest distance between two node of binary search tree.
Interview Answer
Anonymous
Aug 11, 2023
I solved using LCA concept of tree. Distance will be sum of distance from LCA node of both nodes.
Shortest distance between two node of binary search tree.
Anonymous
I solved using LCA concept of tree. Distance will be sum of distance from LCA node of both nodes.
Check out your Company Bowl for anonymous work chats.