Episode 131: One Algorithm To Rule Them All!
Algorithms + Data Structures = Programs
00:00
How to Define a Linear Traversal
You can have a two dimensional data structure like a, like a map. You can still define a linear iteration. A flattened iteration. Something that will start at the beginning and when it comes to the end, it will stop. It can traverse, you know, like you can have a preorder post order in order traversal of a tree. Right. That's that's a linear traversal in the sense that visits every element. Well, it depends on what you define as the element. Now, instead of feeding it in a sequence of every element in the data structure, you can feed it in asequence of just the elements that you selected or things like that. Sure. Yeah
Transcript
Play full episode
