{"provider_url":"https://hatena.blog","provider_name":"Hatena Blog","type":"rich","width":"100%","description":"https://leetcode.com/problems/balanced-binary-tree/ Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as: a binary tree in which the depth of the two subtrees of every node never differ by more than 1. Example 1: Given the following t\u2026","published":"2019-08-04 20:34:59","author_name":"mhiro216","version":"1.0","blog_title":"\u30aa\u30c3\u30c8\u30bb\u30a4\u306e\u7d4c\u55b6\u65e5\u8a8c","image_url":"https://chart.apis.google.com/chart?cht=tx&chl=%20O%28n%20%2A%20h%29","url":"https://mhiro216.hatenablog.com/entry/2019/08/04/203459","categories":["LeetCode"],"height":"190","title":"LeetCode / Balanced Binary Tree","blog_url":"https://mhiro216.hatenablog.com/","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fmhiro216.hatenablog.com%2Fentry%2F2019%2F08%2F04%2F203459\" title=\"LeetCode / Balanced 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>","author_url":"https://blog.hatena.ne.jp/mhiro216/"}