Minimum distance between two nodes in a binary tree
Given a binary tree, find the minimum distance between two given nodes given that they exist ?
Given an integer n, write a function that returns count of trailing zeroes in n!. Examples: Input: n = 5 Output: 1 Factorial of 5 is 20 which has one trailing 0. Input: n = 20 Output: 4 Factorial of 20 is 2432902008176640000 which has 4 trailing zeroes. Input: n = 100 Output: 24
- Find LCA or both nodes (say x,y). Call this LCA as node "L"
ReplyDelete- dist(x,y)=dist(root,x)+dist(root,y)-[2*dist(root,L)]
Essentially, we are trying to compute:
dist(x,y)=dist(x,L)+dist(y,L)
Analysis: O(n) time complexity
@above yes you will have to compute LCA to find minimum distance between two nodes..
ReplyDelete