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!

To make it simplier, look at this images from Google.

Hello,

Thank you for the reply!

I wanted to know:
What kind of practical problems (in Computer Science) can be solved using complete trees?

Thank you!

Someone has already given a very good answer for the same question almost 3 years ago here.