c - what is the maximum possible height of an AVL tree with n nodes -


Is the maximum height of the AVL tree to be found with n nodes. We know that the AVL tree which is approximately 1.44 * logan. If we have 7 nodes, then the maximum possible height is 3 n4 (1.44 * log7).

I think you will know that 1.44 * log (n) log base2 ... is such that ~ 2.08 * ln (n) , which is ~ 7,0475 for 7.

I have seen, Various:

  1.4404 * log2 (n + 2) - 0.328 1.44 * Log2 (n + 1) - 0.3  

But in the case of log2 () all.


Comments

Popular posts from this blog

winforms - C# Form - Property Change -

javascript - amcharts makechart not working -

java - Algorithm negotiation fail SSH in Jenkins -