AVL tree worst case height proof

The worst case height of AVL tree is $$1.44 \log n$$. How do we prove that? I read somewhere about Fibonacci quicks but did not understand it.

• Can you recall where you read about Fibonacci quick? Have you tried proving it by yourself? Please edit the question to show what research you have done and how much progrogress you have made. – Apass.Jack Mar 21 at 13:05
• Possible duplicate of AVL trees are not weight-balanced?. Although the two questions are different, the answer to that question contains a nice explanation of the worst-case height of an AVL tree. – Apass.Jack Mar 21 at 18:18

Once you get to the Fibonacci sequence (the answer to the question above), you can use the fact the the $$n$$-th Fibonacci number is $$O(\phi ^n)$$ (where $$\phi = 1.618\ldots$$), it should be easy to conclude that the worst case height of the tree is $$\log_\phi n = O(\log n)$$.