Hello,

As per wikipedia, a complete binary search tree is defined as:

A complete binary tree is a binary tree in which every level, except possibly the last, is completely filled, and all nodes are as far left as possible

Can someone give me an application of complete binary trees in Computer Science?

Thank you!