how to find both the smallest height and the largest height for an AVL tree

Find both the smallest height and the largest height for an AVL tree with n = 100 nodes, and form n=440 nodes