atom.xml

<?xml version="1.0" encoding="utf-8"?>
<feed xmlns="http://www.w3.org/2005/Atom">
  <title>Herry的网站</title>
  
  
  <link href="http://example.com/atom.xml" rel="self"/>
  
  <link href="http://example.com/"/>
  <updated>2023-10-27T08:38:09.936Z</updated>
  <id>http://example.com/</id>
  
  <author>
    <name>sxsx</name>
    
  </author>
  
  <generator uri="https://hexo.io/">Hexo</generator>
  
  <entry>
    <title>数据结构第二章</title>
    <link href="http://example.com/2023/10/27/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E7%AC%AC%E4%BA%8C%E7%AB%A0/"/>
    <id>http://example.com/2023/10/27/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E7%AC%AC%E4%BA%8C%E7%AB%A0/</id>
    <published>2023-10-27T08:34:12.000Z</published>
    <updated>2023-10-27T08:38:09.936Z</updated>
    
    <content type="html"><![CDATA[<p>ss</p>]]></content>
    
    
      
      
    <summary type="html">&lt;p&gt;ss&lt;/p&gt;
</summary>
      
    
    
    
    <category term="数据结构" scheme="http://example.com/categories/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/"/>
    
    
  </entry>
  
  <entry>
    <title>数据结构第六章</title>
    <link href="http://example.com/2023/10/26/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E7%AC%AC%E5%85%AD%E7%AB%A0/"/>
    <id>http://example.com/2023/10/26/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E7%AC%AC%E5%85%AD%E7%AB%A0/</id>
    <published>2023-10-26T11:07:38.000Z</published>
    <updated>2023-10-28T02:03:13.177Z</updated>
    
    <content type="html"><![CDATA[<h2 id="&#x9898;&#x76EE;&#x5E8F;&#x53F7;DC06PE02"><a href="#&#x9898;&#x76EE;&#x5E8F;&#x53F7;DC06PE02" class="headerlink" title="&#x9898;&#x76EE;&#x5E8F;&#x53F7;DC06PE02"></a>&#x9898;&#x76EE;&#x5E8F;&#x53F7;DC06PE02</h2><figure class="highlight c"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br></pre></td><td class="code"><pre><span class="line"><span class="meta">#<span class="keyword">include</span> <span class="string">&quot;allinclude.h&quot;</span></span></span><br><span class="line">Status <span class="title function_">is_Desendant</span><span class="params">(SqBiTree T, <span class="type">int</span> u, <span class="type">int</span> v)</span>  </span><br><span class="line">{  <span class="comment">// Add your code here</span></span><br><span class="line">   <span class="keyword">if</span>(v&gt;T.lastIndex || u&gt;T.lastIndex || v&lt;=u || u&lt;<span class="number">1</span> || v&lt;<span class="number">1</span>) </span><br><span class="line">  <span class="keyword">return</span> FALSE;</span><br><span class="line"></span><br><span class="line"><span class="keyword">while</span> (v&gt;u) {</span><br><span class="line">    <span class="keyword">if</span> (v/<span class="number">2</span>==u) {</span><br><span class="line">        <span class="keyword">return</span> TRUE;</span><br><span class="line">    }</span><br><span class="line">    v/=<span class="number">2</span>;</span><br><span class="line">}</span><br><span class="line"><span class="keyword">return</span> FALSE;</span><br><span class="line"></span><br><span class="line">}</span><br></pre></td></tr></table></figure><span id="more"></span><h2 id="DC06PE11"><a href="#DC06PE11" class="headerlink" title="DC06PE11"></a><strong>DC06PE11</strong></h2><figure class="highlight c"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br></pre></td><td class="code"><pre><span class="line"><span class="meta">#<span class="keyword">include</span> <span class="string">&quot;allinclude.h&quot;</span>  <span class="comment">//DO NOT edit this line</span></span></span><br><span class="line"></span><br><span class="line">TElemType <span class="title function_">PreOrderKHelper</span><span class="params">(BiTree T, <span class="type">int</span>* k)</span></span><br><span class="line"></span><br><span class="line">{</span><br><span class="line"></span><br><span class="line">  <span class="keyword">if</span>(T == <span class="literal">NULL</span> || *k &lt;= <span class="number">0</span>)</span><br><span class="line"></span><br><span class="line">    <span class="keyword">return</span> <span class="string">&apos;#&apos;</span>;</span><br><span class="line"></span><br><span class="line">  <span class="keyword">if</span> (--(*k) == <span class="number">0</span>)</span><br><span class="line"></span><br><span class="line">    <span class="keyword">return</span> T-&gt;data;</span><br><span class="line"></span><br><span class="line">  TElemType left = PreOrderKHelper(T-&gt;lchild, k);</span><br><span class="line"></span><br><span class="line">  <span class="keyword">if</span> (*k == <span class="number">0</span>)</span><br><span class="line"></span><br><span class="line">    <span class="keyword">return</span> left;</span><br><span class="line"></span><br><span class="line">  <span class="keyword">return</span> PreOrderKHelper(T-&gt;rchild, k);</span><br><span class="line"></span><br><span class="line">}</span><br><span class="line"></span><br><span class="line">TElemType <span class="title function_">PreOrderK</span><span class="params">(BiTree T, <span class="type">int</span> k)</span> {</span><br><span class="line"></span><br><span class="line">  <span class="keyword">return</span> PreOrderKHelper(T, &amp;k);</span><br><span class="line"></span><br><span class="line">}</span><br></pre></td></tr></table></figure><h2 id="DC06PE12"><a href="#DC06PE12" class="headerlink" title="DC06PE12"></a><strong>DC06PE12</strong></h2><figure class="highlight c"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br></pre></td><td class="code"><pre><span class="line">\<span class="meta">#<span class="keyword">include</span> <span class="string">&quot;allinclude.h&quot;</span>  <span class="comment">//DO NOT edit this line</span></span></span><br><span class="line"></span><br><span class="line"><span class="type">int</span> <span class="title function_">countLeavesHelper</span><span class="params">(BiTree T)</span>{</span><br><span class="line"></span><br><span class="line">  <span class="keyword">if</span>(T==<span class="literal">NULL</span>)</span><br><span class="line"></span><br><span class="line">&#x200B;    <span class="keyword">return</span> <span class="number">0</span>;</span><br><span class="line"></span><br><span class="line">  <span class="keyword">if</span>(T-&gt;lchild==<span class="literal">NULL</span>&amp;&amp;T-&gt;rchild==<span class="literal">NULL</span>)</span><br><span class="line"></span><br><span class="line">  {</span><br><span class="line"></span><br><span class="line">&#x200B;    <span class="keyword">return</span>  <span class="number">1</span>;</span><br><span class="line"></span><br><span class="line">  }</span><br><span class="line"></span><br><span class="line">  <span class="type">int</span> left = countLeavesHelper(T-&gt;lchild);</span><br><span class="line"></span><br><span class="line">  <span class="type">int</span> right = countLeavesHelper(T-&gt;rchild);</span><br><span class="line"></span><br><span class="line">  <span class="keyword">return</span> left+right;</span><br><span class="line"></span><br><span class="line">}</span><br><span class="line"></span><br><span class="line"><span class="type">int</span> <span class="title function_">Leaves</span><span class="params">(BiTree T)</span></span><br><span class="line"></span><br><span class="line">{</span><br><span class="line"></span><br><span class="line">  <span class="keyword">return</span> countLeavesHelper(T);</span><br><span class="line"></span><br><span class="line">}</span><br></pre></td></tr></table></figure>]]></content>
    
    
    <summary type="html">&lt;h2 id=&quot;&amp;#x9898;&amp;#x76EE;&amp;#x5E8F;&amp;#x53F7;DC06PE02&quot;&gt;&lt;a href=&quot;#&amp;#x9898;&amp;#x76EE;&amp;#x5E8F;&amp;#x53F7;DC06PE02&quot; class=&quot;headerlink&quot; title=&quot;&amp;#x9898;&amp;#x76EE;&amp;#x5E8F;&amp;#x53F7;DC06PE02&quot;&gt;&lt;/a&gt;&amp;#x9898;&amp;#x76EE;&amp;#x5E8F;&amp;#x53F7;DC06PE02&lt;/h2&gt;&lt;figure class=&quot;highlight c&quot;&gt;&lt;table&gt;&lt;tr&gt;&lt;td class=&quot;gutter&quot;&gt;&lt;pre&gt;&lt;span class=&quot;line&quot;&gt;1&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;2&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;3&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;4&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;5&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;6&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;7&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;8&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;9&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;10&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;11&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;12&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;13&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;14&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;15&lt;/span&gt;&lt;br&gt;&lt;/pre&gt;&lt;/td&gt;&lt;td class=&quot;code&quot;&gt;&lt;pre&gt;&lt;span class=&quot;line&quot;&gt;&lt;span class=&quot;meta&quot;&gt;#&lt;span class=&quot;keyword&quot;&gt;include&lt;/span&gt; &lt;span class=&quot;string&quot;&gt;&amp;quot;allinclude.h&amp;quot;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;Status &lt;span class=&quot;title function_&quot;&gt;is_Desendant&lt;/span&gt;&lt;span class=&quot;params&quot;&gt;(SqBiTree T, &lt;span class=&quot;type&quot;&gt;int&lt;/span&gt; u, &lt;span class=&quot;type&quot;&gt;int&lt;/span&gt; v)&lt;/span&gt;  &lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;{  &lt;span class=&quot;comment&quot;&gt;// Add your code here&lt;/span&gt;&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;   &lt;span class=&quot;keyword&quot;&gt;if&lt;/span&gt;(v&amp;gt;T.lastIndex || u&amp;gt;T.lastIndex || v&amp;lt;=u || u&amp;lt;&lt;span class=&quot;number&quot;&gt;1&lt;/span&gt; || v&amp;lt;&lt;span class=&quot;number&quot;&gt;1&lt;/span&gt;) &lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;  &lt;span class=&quot;keyword&quot;&gt;return&lt;/span&gt; FALSE;&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;&lt;span class=&quot;keyword&quot;&gt;while&lt;/span&gt; (v&amp;gt;u) {&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;    &lt;span class=&quot;keyword&quot;&gt;if&lt;/span&gt; (v/&lt;span class=&quot;number&quot;&gt;2&lt;/span&gt;==u) {&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;        &lt;span class=&quot;keyword&quot;&gt;return&lt;/span&gt; TRUE;&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;    }&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;    v/=&lt;span class=&quot;number&quot;&gt;2&lt;/span&gt;;&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;}&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;&lt;span class=&quot;keyword&quot;&gt;return&lt;/span&gt; FALSE;&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;}&lt;/span&gt;&lt;br&gt;&lt;/pre&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/figure&gt;</summary>
    
    
    
    <category term="数据结构" scheme="http://example.com/categories/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/"/>
    
    
    <category term="BiTree" scheme="http://example.com/tags/BiTree/"/>
    
  </entry>
  
</feed>