You are given n real numbers in an array. A number in the array is called a decimal dominant if it occurs more than n/10 times in the array. Give an O(n) time algorithm to determine if the given array has a decimal dominant.
Implement a function getbits, that returns the(right adjusted) n bits that begin at position p of an integer. Assume bit position 0 is at the right end and that n and p are sensible positive values.
- 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