{"type":"rich","provider_url":"https://hatena.blog","html":"<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 - \u30aa\u30c3\u30c8\u30bb\u30a4\u306e\u7d4c\u55b6\u65e5\u8a8c\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","width":"100%","description":"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\u2026","provider_name":"Hatena Blog","categories":["LeetCode"],"blog_url":"https://mhiro216.hatenablog.com/","version":"1.0","published":"2019-07-28 09:32:32","title":"LeetCode / Maximum Depth of Binary Tree","image_url":"https://chart.apis.google.com/chart?cht=tx&chl=%20O%28n%20%2A%20h%29","url":"https://mhiro216.hatenablog.com/entry/2019/07/28/093232","author_url":"https://blog.hatena.ne.jp/mhiro216/","height":"190","blog_title":"\u30aa\u30c3\u30c8\u30bb\u30a4\u306e\u7d4c\u55b6\u65e5\u8a8c","author_name":"mhiro216"}