title: How AVL tree can guarantee O(log(n)) search all the time
body: <p>Excuse me if it's a stupid question. I heard that AVL tree has O(log(n)) for search but I do not understand how could it always guarantees log(n) search.</p>