0
$\begingroup$

Here N represents the number of elements in the multi-tree. Please state the algorithm that you have used to do so. It would be great if you can implement this in Java/C++ too and post the code as well.

Also I used union-find to initialize the tree. You can consider or not consider this algorithm. I just need the algorithm to search for the maximum element in a multi-tree. That would clear my problem.

$\endgroup$
  • 3
    $\begingroup$ What is a multi-tree? $\endgroup$ – Yuval Filmus May 29 '17 at 6:41
  • 1
    $\begingroup$ Also, in this site we never post code in Java/C++, only pseudocode. $\endgroup$ – Yuval Filmus May 29 '17 at 6:41

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.