{"version":"1.0","title":"LeetCode / Same Tree","url":"https://mhiro216.hatenablog.com/entry/2019/07/26/165138","description":"https://leetcode.com/problems/same-tree/ Given two binary trees, write a function to check if they are the same or not. Two binary trees are considered the same if they are structurally identical and the nodes have the same value. LeetCode\u3067\u306f\u30d0\u30a4\u30ca\u30ea\u30c4\u30ea\u30fc\uff08\u4e8c\u5206\u6728\uff09\u3092\u4f7f\u3063\u305f\u554f\u984c\u304c\u983b\u51fa\u3057\u307e\u3059\u304c\u3001\u305d\u306e\u3046\u3061\u306e1\u3064\u3067\u3059\u3002 2\u3064\u306e\u30d0\u30a4\u30ca\u30ea\u30c4\u30ea\u30fc\u304c\u540c\u4e00\u306e\u3082\u306e\u304b\u3069\u3046\u304b\u5224\u5b9a\u2026","width":"100%","blog_title":"\u30aa\u30c3\u30c8\u30bb\u30a4\u306e\u7d4c\u55b6\u65e5\u8a8c","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fmhiro216.hatenablog.com%2Fentry%2F2019%2F07%2F26%2F165138\" title=\"LeetCode / Same 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>","categories":["LeetCode"],"height":"190","author_name":"mhiro216","author_url":"https://blog.hatena.ne.jp/mhiro216/","provider_url":"https://hatena.blog","blog_url":"https://mhiro216.hatenablog.com/","image_url":"https://chart.apis.google.com/chart?cht=tx&chl=%20O%28n%20%2A%20h%29","provider_name":"Hatena Blog","type":"rich","published":"2019-07-26 16:51:38"}