Editing AVL tree (section)

===Traversal===
As a read-only operation the traversal of an AVL tree functions the same way as on any other binary tree. Exploring all {{math|''n''}} nodes of the tree visits each link exactly twice: one downward visit to enter the subtree rooted by that node, another visit upward to leave that node's subtree after having explored it.

Once a node has been found in an AVL tree, the ''next'' or ''previous'' node can be accessed in [[amortized complexity|amortized]] constant time.<ref name="Pfaff" />{{rp|58}} Some instances of exploring these "nearby" nodes require traversing up to {{math|''h'' ∝ log(''n'')}} links (particularly when navigating from the rightmost leaf of the root's left subtree to the root or from the root to the leftmost leaf of the root's right subtree; in the AVL tree of figure 1, navigating from node P to the next-to-the-right node Q takes 3 steps). Since there are {{math|''n''−1}} links in any tree, the amortized cost is {{math|2×(''n''−1)/''n''}}, or approximately 2.