A Fibonacci heap containing n nodes can have a single tree with height n, consisting of a root connected to a leaf by a path of n nodes. This contrasts with a binary heap, where the maximum height of a tree storing n elements is logn. A sequence of O(n) Fibonacci heap operations starting from an empty heap can construct such a tree with height n and a single path from the root to a leaf.