-2

What is the minimum and maximum number of nodes on an AVL tree of height 6?

StoryTeller - Unslander Monica
  • 165,132
  • 21
  • 377
  • 458
dilk
  • 103
  • 3
  • 10
  • 1
    This is an easy question if you understand what an AVL tree is. I suggest that you go through your course material. – timgeb Sep 11 '17 at 12:25
  • because i'm using python and c++ in implementation – dilk Sep 11 '17 at 12:26
  • @timgeb can u pls explain.. because i cant find – dilk Sep 11 '17 at 12:27
  • 1
    @user2530960 No, I won't accept your lie that you can't find an explanation of AVL trees online. – timgeb Sep 11 '17 at 12:27
  • If I can find the answer to this question, why should i bother to postit here?? – dilk Sep 11 '17 at 12:28
  • 3
    You are not supposed to "find" the answer. You are supposed to understand what an AVL tree is and then infer the answer to the question using your brain. Since you did not give us any specific point where you are stuck in your reasoning, we have nothing to work with here. – timgeb Sep 11 '17 at 12:29
  • can't you explain how to get the answer? I dont have any clue!!! – dilk Sep 11 '17 at 12:30
  • don't you understand you telling me this question is too easy won;t help me.. isn't this website is for mutual help? or criticizing what is easy and what is not?? – dilk Sep 11 '17 at 12:32
  • 3
    You clearly have a wrong idea about this website. It is not a homework help hotline for lazy students. We actually do help with homework, but only if the author shows own effort and has a specific question. "Give solution plz" is not a question. – timgeb Sep 11 '17 at 12:33
  • The maximum is easy: it's a complete binary tree. For the minimum, see https://stackoverflow.com/questions/21347187/minimum-number-of-node-in-avl-tree. – Jim Mischel Sep 11 '17 at 13:20
  • You are missing the definition of AVL tree.. – gmavridakis Dec 05 '21 at 18:46

1 Answers1

2

n(h) be the minimum number of nodes of an AVL tree of height h, then:

n(0) = 1
n(1) = 2
n(h) = 1 + n(h-1) + n(h-2)

as discussed here.

A complete AVL tree is a complete binary tree, thus the maximum number of nodes is 2k + 1 - 1, as discussed here.

gsamaras
  • 71,951
  • 46
  • 188
  • 305