coding-interview-6-599.pdf - 241 Minimum Depth of Binary Tree Given a binary tree find its minimum depth The minimum depth is the number of nodes along

coding-interview-6-599.pdf - 241 Minimum Depth of Binary...

This preview shows page 1 out of 1 page.

241 Minimum Depth of Binary Tree 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. 241.1 Thoughts LinkedList is a queue in Java. The add() and remove() methods are used to manipulate the queue. 241.2 Java Solution / ** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; }

You've reached the end of your free preview.

Want to read the whole page?

• Fall '12
• KORB
• Graph Theory, Minimum Depth of Binary Tree

What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern

Stuck? We have tutors online 24/7 who can help you get unstuck.
Ask Expert Tutors You can ask You can ask You can ask (will expire )
Answers in as fast as 15 minutes