LeetCode – Minimum Depth of Binary Tree (Java)

Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node. Thoughts LinkedList is a queue in Java. The add() and remove() methods are used to manipulate the queue. Java Solution /** * Definition for binary … Read more