Question

minimun number of nodes that can be present ina AVL tree of height h is

Answer 1

Step-by-step explanation:

Dear your answer is here....☺️☺️☺️

please mark me brain list ❤️❤️

• If height of AVL tree is h, maximum number of nodes can be 2h+1 – 1.
• Minimum number of nodes in a tree with height h can be represented as:

N(h) = N(h-1) + N(h-2) + 1 for n>2 where N(0) = 1 and N(1) = 2.

• The complexity of searching, inserting and deletion in AVL tree is O(log n).