https://gateoverflow.in/262062/avl-tree
https://gateoverflow.in/44411/find-the-minimum-no-of-nodes-in-an-avl-tree-of-height-9
For this question u can use this formula
In S(h) = S(h-1) + S(h-2) + 1,
S(h) = S(h-1) + S(h-2) + 1
S(h) is a recursive function/formula.
S(h)
Note that a recursive function must have some base cases, in this case:
S(0) = 1 S(1) = 2
So let's say h = 10, then S(h = 10)
h = 10
S(h = 10)
@imnitish
Brother i know it.... I just inform you
64.3k questions
77.9k answers
244k comments
80.0k users