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.
$\begingroup$
$\endgroup$
Add a comment
|
1 Answer
$\begingroup$
$\endgroup$
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.
answered Aug 5, 2021 at 12:04