What is a balanced tree and what are the advantages of using it?

  

What is a balanced tree?

A balanced tree and a structure where the depth of its node is always organized in ascending or descending order, the root being the central value from its leaves, it can have static or dynamic balancing. Static balancing happens after it has received all input, now the dynamic balancing happens with the use of Time Rotation algorithm that to a new input.

  

What differs from a normal tree

The difference is that basically a normal one can have a side with much more leaf and deeper thus making its search slower

  

And what are the advantages of using it?

It is a tree where the search becomes faster since a question is enough to know which way to go.