I studying the related question.https://stackoverflow.com/questions/13500560/number-of-ways-to-create-an-avl-tree-with-n-nodes-and-l-leaf-node but it's not so general.In-fact, We want to know with N keys, how many different AVL Tree, we can make? we know with N=1 key is 1 AVL Tree. with N=2 key we have 2 different AVL Tree, but in general we can make any recurrence formula? for example for N=4, N=5 and so on.
Number of Different AVL Tree
algorithms;graph theory;data structures;trees;binary trees