Thursday, May 3, 2018

Leetcode 102: Binary tree level order traversal

May 3, 2018


Introduction


It was my mock interview algorithm on May 2, 2018. I was told very honestly that I should memorize the common queue technique, using breadth first search, two loops, outer loop for each level, inner loop for each node in the level.

I decide to write a few solutions based on Leetcode 102 discussion.

Algorithm practice


Here is my C# practice to use the idea of two loops, outer loop for each level, inner loop for all elements in the level.


No comments:

Post a Comment