Understanding Depth & Breadth-First Search in Swift

In this series, we’ve explored various advanced data structures such as binary search trees and graphs. Once built, these structures can exhibit properties like other collections. As such, their contents can also be explored through a process called Traversal. In this chapter, we’ll review this process and will introduce the concepts of Depth-First and Breadth-First Search.




Modern code, Illustrations & Computer science

Recommended from Medium

Building a Serverless CI/CD Pipeline on AWS.

Does MVC still matter and should you use it?

Customer Development in DeFi

Move your sidebar to the right side

What is polyglot programming?

N+1 selects problem in ORM (Object-Relational Mapping) and What Laravel offers to fix it.

A Serious Performance Issue With Logback

How We Created a Great Data Transfer Service from a Hairball Using Google Cloud Pub/Sub

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
Wayne Bishop

Wayne Bishop

I write about Swift Development & Computer Science. Get more tips on technical interview preparation at — www.waynewbishop.com

More from Medium

Advanced Swift Concurrency — How to create multiple parallel Tasks

Equal Stacks Swift HackerRank Solution

[Codility] CyclicRotation (Swift)

Radians Are Useful In Swift