About 271,000 results
Open links in new tab
  1. TRAVERSAL Definition & Meaning - Merriam-Webster

    The meaning of TRAVERSAL is the act or an instance of traversing.

  2. Traversal - definition of traversal by The Free Dictionary

    Define traversal. traversal synonyms, traversal pronunciation, traversal translation, English dictionary definition of traversal. v. tra·versed , tra·vers·ing , tra·vers·es v. tr. 1. a. To travel or pass across, …

  3. TRAVERSAL definition in American English | Collins English Dictionary

    TRAVERSAL definition: to pass or go over or back and forth over (something); cross | Meaning, pronunciation, translations and examples in American English

  4. traversal, n. meanings, etymology and more | Oxford English Dictionary

    traversal, n. meanings, etymology, pronunciation and more in the Oxford English Dictionary

  5. Tree traversal - Wikipedia

    In computer science, tree traversal (also known as tree search and walking the tree) is a form of graph traversal and refers to the process of visiting (e.g. retrieving, updating, or deleting) each node in a …

  6. Tree Traversal Techniques - GeeksforGeeks

    Dec 6, 2025 · Tree traversal refers to the process of visiting or accessing each node of a tree exactly once in a specific order. Unlike linear data structures such as arrays, linked lists, or queues (which …

  7. traversal - Wiktionary, the free dictionary

    Dec 5, 2025 · traversal (countable and uncountable, plural traversals) His traversal of the mountains allowed him a view from the peak.

  8. Traversal - Definition, Meaning & Synonyms | Vocabulary.com

    Whether you’re a teacher or a learner, Vocabulary.com can put you or your class on the path to systematic vocabulary improvement.

  9. traversal | Definition and example sentences - Cambridge Dictionary

    Traversal is the process of visiting each node in a data structure, and performing some action.

  10. Traversals | Brilliant Math & Science Wiki

    Traversals A tree traversal, also known as tree searches, are algorithms executed on graphs containing only tree edges, that visit each node exactly once. Algorithms in this category differ only in the order …