<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<oembed>
  <author_name>mhiro216</author_name>
  <author_url>https://blog.hatena.ne.jp/mhiro216/</author_url>
  <blog_title>オットセイの経営日誌</blog_title>
  <blog_url>https://mhiro216.hatenablog.com/</blog_url>
  <categories>
    <anon>LeetCode</anon>
  </categories>
  <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ではバイナリツリー（二分木）を使った問題が頻出しますが、そのうちの1つです。 2つのバイナリツリーが同一のものかどうか判定…</description>
  <height>190</height>
  <html>&lt;iframe src=&quot;https://hatenablog-parts.com/embed?url=https%3A%2F%2Fmhiro216.hatenablog.com%2Fentry%2F2019%2F07%2F26%2F165138&quot; title=&quot;LeetCode / Same Tree - オットセイの経営日誌&quot; class=&quot;embed-card embed-blogcard&quot; scrolling=&quot;no&quot; frameborder=&quot;0&quot; style=&quot;display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;&quot;&gt;&lt;/iframe&gt;</html>
  <image_url>https://chart.apis.google.com/chart?cht=tx&amp;chl=%20O%28n%20%2A%20h%29</image_url>
  <provider_name>Hatena Blog</provider_name>
  <provider_url>https://hatena.blog</provider_url>
  <published>2019-07-26 16:51:38</published>
  <title>LeetCode / Same Tree</title>
  <type>rich</type>
  <url>https://mhiro216.hatenablog.com/entry/2019/07/26/165138</url>
  <version>1.0</version>
  <width>100%</width>
</oembed>
