in DS
438 views
0 votes
0 votes
The minimum number of nodes in an AVL Tree of height 10 is..........
in DS
438 views

1 Answer

1 vote
1 vote

For this question u can use this formula

In S(h) = S(h-1) + S(h-2) + 1,

S(h) is a recursive function/formula

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)

edited by

4 Comments

@imnitish

Brother i know it.... I just inform you

0
0
oooooo

Thanks bro
0
0
ans 232?
0
0