Yan Cui
I help clients go faster for less using serverless technologies.
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.
- Consulting: If you want to improve feature velocity, reduce costs, and make your systems more scalable, secure, and resilient, then let’s work together and make it happen.
- Join my FREE Community on Skool, where you can ask for help, share your success stories and hang out with me and other like-minded people without all the negativity from social media.
Pingback: Implementing a BST in F# | theburningmonk.com
Pingback: Advent of Code F# – Day 22 | theburningmonk.com