1
$\begingroup$

Wondering what are the real word applications of the Complete binary trees or Almost complete binary trees where the the last level of the tree may not be complete and all nodes in the last level are aligned to the left.

$\endgroup$
0
$\begingroup$

That would be the binairy heap implementation of a priority queue.

The tree itself would be stored in an array, where access to children and parent is via computation of the position of the other nodes.

$\endgroup$

Your Answer

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

Not the answer you're looking for? Browse other questions tagged or ask your own question.