Tag Info

New answers tagged

0

While I originally looked into what would require the use of some Tree Topology or use of Bloom Filters, I asked a friend on this problem. He gave me a more practical solution: Sort each Tree by Leaves Seperately Then you put each result in heaps - sort of like a merge step of the quick sort algorithm. You then take the First Heap from the first tree and ...



Top 50 recent answers are included