Introduction
It is my mock interview for code screen, I spent one hour on it but I could not solve it. I know that the statement is not so clear and the way to find the next minimum height of tree should be solved using breadth first search.
Half baked solution
It is a hard level algorithm and I had the idea to write the solution, but I did not have time to write down BFS algorithm.
No comments:
Post a Comment