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 4 ways I can help you:
- If you want a one-stop shop to help you quickly level up your serverless skills, you should check out my Production-Ready Serverless workshop. Over 20 AWS Heroes & Community Builders have passed through this workshop, plus 1000+ students from the likes of AWS, LEGO, Booking, HBO and Siemens.
- If you want to learn how to test serverless applications without all the pain and hassle, you should check out my latest course, Testing Serverless Architectures.
- If you’re a manager or founder and want to help your team move faster and build better software, then check out my consulting services.
- If you just want to hang out, talk serverless, or ask for help, then you should join my FREE Community.
Pingback: Implementing a BST in F# | theburningmonk.com
Pingback: Advent of Code F# – Day 22 | theburningmonk.com