mhiro216 https://blog.hatena.ne.jp/mhiro216/ オットセイの経営日誌 https://mhiro216.hatenablog.com/ LeetCode https://leetcode.com/problems/maximum-depth-of-binary-tree/ Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. Note: A leaf is a node with no children. Example: Given binary tree [3,9,20,null… 190 <iframe src="https://hatenablog-parts.com/embed?url=https%3A%2F%2Fmhiro216.hatenablog.com%2Fentry%2F2019%2F07%2F28%2F093232" title="LeetCode / Maximum Depth of Binary Tree - オットセイの経営日誌" class="embed-card embed-blogcard" scrolling="no" frameborder="0" style="display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;"></iframe> https://chart.apis.google.com/chart?cht=tx&chl=%20O%28n%20%2A%20h%29 Hatena Blog https://hatena.blog 2019-07-28 09:32:32 rich https://mhiro216.hatenablog.com/entry/2019/07/28/093232 1.0 100%