Editing Space complexity (section)

==Auxiliary space complexity==

The term '''{{visible anchor|auxiliary space}}''' refers to space other than that consumed by the input.
Auxiliary space complexity could be formally defined in terms of a [[Turing machine]] with a separate ''input tape'' which cannot be written to, only read, and a conventional working tape which can be written to.
The auxiliary space complexity is then defined (and analyzed) via the working tape.
For example, consider the [[depth-first search]] of a [[Binary tree#Types of binary trees|balanced binary tree]] with <math>n</math> nodes: its auxiliary space complexity is <math>\Theta(\log n).</math>