0

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!

2
Contributors
4
Replies
8
Views
5 Years
Discussion Span
Last Post by javaprog200
0

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!

This question has already been answered. Start a new discussion instead.
Have something to contribute to this discussion? Please be thoughtful, detailed and courteous, and be sure to adhere to our posting rules.