Skip to content

Latest commit

 

History

History
1 lines (1 loc) · 190 Bytes

File metadata and controls

1 lines (1 loc) · 190 Bytes

Find the distance between two keys in a binary tree, no parent pointers are given. Distance between two nodes is the minimum number of edges to be traversed to reach one node from other.