# In-Order Traversal

*noun*

say it: **“IN OR-der truh-VUR-sul”** **/ɪn ˈɔrdɚ trəˈvɝsəl/**

A walk of a binary tree that visits the left side, then the node, then the right side, giving sorted order in a binary search tree.

## What is an **in-order traversal**?

An **in-order traversal** visits a binary tree's left side, then the node, then its right side. In a binary search tree that lists every value in sorted order, such as contacts from A to Z.

## In a sentence

- “An **in-order traversal** of the contact tree lists every name from A to Z.”

Level: Journeyman · [More Data Structures terms at this level](https://www.ask-codey.com/glossary?category=data-structures&level=3)

Updated: November 9, 2026

Source: https://www.ask-codey.com/glossary/in-order-traversal
