tags:

views:

67

answers:

3

BBTHMNN(h) = Balanced Binary Tree Have Minimum Number Of Nodes

BBTHMNN(h) = BBTHMNN(h-1) + BBTHMNN(h-2) + 1

Name of the balanced binary tree which satisfying the above formula. I have searched all over the internet but I couldn't found the name of the tree

A: 

Kinda looks like the Fibonachi Series. Perhaps Fibonachi Tree?

Ben
Did you mis-spell Fibonacci to try and increase the challenge for the poster? ;)
jball
lol at @jball, that would be a tad confusing!
Rippo
yes it may be the Fibonacci tree
Moody
So mark it as the answer and I'll get my precious points! :-)
Ben
A: 

Knowing that you can not have searched the entire internet, at least not properly, I'll point you to the simplest resource that may help you find better search terms for your question: Wikipedia.

A perfect binary tree is a full binary tree in which all leaves are at the same depth or same level.[3] (This is ambiguously also called a complete binary tree.)

A complete binary tree is a binary tree in which every level, except possibly the last, is completely filled, and all nodes are as far left as possible.[4]

jball
A: 

Your question isn't entirely clear to me, so I may be misunderstanding you here, but it sounds like you might be looking for an AVL tree. These often show up in homework as they were the first tree data structures.

fatcat1111