Propose a tree based data structure to identify a node with mth rank with maximum efficiency .
priority heap
mLog(n) time to find mth max or min number, n is the number of nodes, m is the rank. To find max mth, use maxheap, to find min mth, use minheap
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment