Level Order Tree Traversal in F#

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

2 Comments

  1. Pingback: Implementing a BST in F# | theburningmonk.com

  2. Pingback: Advent of Code F# – Day 22 | theburningmonk.com

Leave a Reply

Your email address will not be published.