Binomial heap implementation java

function merge(p, q)
    while not (p.end() and q.end())
        tree = mergeTree(p.currentTree(), q.currentTree())
        
        if not heap.currentTree().empty()
            tree = mergeTree(tree, heap.currentTree())
        
        heap.addTree(tree)
        heap.next(); p.next(); q.next()

Source: formulasearchengine.com

Similar codes

0 vote349 views1 answer
Python discord embed generator
Java
0 vote351 views1 answer
Crit chance in java
Java
4 votes346 views2 answers
Get number of lines in a file java
Java
0 vote299 views1 answer
Paper api maven
Java
28 votes345 views6 answers
How to get current date in java
Java
0 vote340 views1 answer
Java stdin
Java
0 vote349 views1 answer
How to use java code to print with a network printer
Java
-2 votes341 views1 answer
Style jbuttons
Java
0 vote316 views1 answer
Java quote of the day
Java
0 vote328 views1 answer
Aabb collision java
Java