#self doubt

Question

The minimum number of nodes in an AVL Tree of height 10 is..........

Comments

https://gateoverflow.in/262062/avl-tree

https://gateoverflow.in/44411/find-the-minimum-no-of-nodes-in-an-avl-tree-of-height-9

Answer 1

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)

Comments

@imnitish

S(1) = 0
S(2) = 1

what the mean of this base conditions?

with height=1 ==> no.of minimum nodes=0

with height=2 ==> no.of minimum nodes=1

 

is this right?

---

No i have written wrong mistakenly.

s(0)=1

s(1)=2

s(2)=4

with height=0 ==> no.of minimum nodes=1

with height=1 ==> no.of minimum nodes=2

with height=2 ==> no.of minimum nodes=4

Sorry for mistake

---

U can refer to following link

https://gateoverflow.in/44411/find-the-minimum-no-of-nodes-in-an-avl-tree-of-height-9

---

@imnitish

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

---

oooooo

Thanks bro

---

ans 232?