Yan Cui
I help clients go faster for less using serverless technologies.
This article is brought to you by
Don’t reinvent the patterns. Catalyst gives you consistent APIs for messaging, data, and workflow with key microservice patterns like circuit-breakers and retries for free.
Another common problem I see during my preparation for technical interviews is the Level Order Tree Traversal (or Breadth-First) problem.
I always like to think with my F# hat on when I solve algorithm problem, so here’s an implementation in F# 
.
Here we have a nested recursive loop function that:
- yields the value from the nodes on the current level
- then find all the children of the nodes on the current level and recurse with them
Try it Yourself
Links
- GeeksForGeeks article on Level Order Tree Traversal
- Interview question on CareerCup A
- Interview question on CareerCup B
- DotNetFiddle snippet
- All my Project Euler solutions in F#
- All my Advent of Code solutions in F#
Whenever you’re ready, here are 3 ways I can help you:
- Production-Ready Serverless: Join 20+ AWS Heroes & Community Builders and 1000+ other students in levelling up your serverless game. This is your one-stop shop for quickly levelling up your serverless skills.
- I help clients launch product ideas, improve their development processes and upskill their teams. If you’d like to work together, then let’s get in touch.
- Join my community on Discord, ask questions, and join the discussion on all things AWS and Serverless.
Pingback: Implementing a BST in F# | theburningmonk.com
Pingback: Advent of Code F# – Day 22 | theburningmonk.com