⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 group____gdsl__bintree.html

📁 一个通用的C语言实现的数据结构
💻 HTML
📖 第 1 页 / 共 5 页
字号:
          <td class="md" valign="top">&nbsp;)&nbsp;</td>          <td class="md" nowrap></td>        </tr>      </table>    </td>  </tr></table><table cellspacing="5" cellpadding="0" border="0">  <tr>    <td>      &nbsp;    </td>    <td><p>Check if a low-level binary tree is reduced to a leaf. <p><dl compact><dt><b>Note:</b></dt><dd>Complexity: O( 1 ) </dd></dl><dl compact><dt><b>Precondition:</b></dt><dd>T must be a non-empty _gdsl_bintree_t. </dd></dl><dl compact><dt><b>Parameters:</b></dt><dd>  <table border="0" cellspacing="2" cellpadding="0">    <tr><td valign="top"></td><td valign="top"><em>T</em>&nbsp;</td><td>The low-level binary tree to check. </td></tr>  </table></dl><dl compact><dt><b>Returns:</b></dt><dd>TRUE if the low-level binary tree T is a leaf. <p>FALSE if the low-level binary tree T is not a leaf. </dd></dl><dl compact><dt><b>See also:</b></dt><dd><a class="el" href="group____gdsl__bintree.html#g78d1edf127bc12942a83b6add1f6d642">_gdsl_bintree_is_empty()</a> <p><a class="el" href="group____gdsl__bintree.html#gc66dabdae780172e64264eb4065ef156">_gdsl_bintree_is_root()</a> </dd></dl>    </td>  </tr></table><a class="anchor" name="gc66dabdae780172e64264eb4065ef156"></a><!-- doxytag: member="_gdsl_bintree.h::_gdsl_bintree_is_root" ref="gc66dabdae780172e64264eb4065ef156" args="(const _gdsl_bintree_t T)" --><p><table class="mdTable" cellpadding="2" cellspacing="0">  <tr>    <td class="mdRow">      <table cellpadding="0" cellspacing="0" border="0">        <tr>          <td class="md" nowrap valign="top"><a class="el" href="group__gdsl__types.html#gf6a258d8f3ee5206d682d799316314b1">bool</a> _gdsl_bintree_is_root           </td>          <td class="md" valign="top">(&nbsp;</td>          <td class="md" nowrap valign="top">const <a class="el" href="group____gdsl__bintree.html#g797c557a551a057c0763387ce7b92fbe">_gdsl_bintree_t</a>&nbsp;</td>          <td class="mdname1" valign="top" nowrap> <em>T</em>          </td>          <td class="md" valign="top">&nbsp;)&nbsp;</td>          <td class="md" nowrap></td>        </tr>      </table>    </td>  </tr></table><table cellspacing="5" cellpadding="0" border="0">  <tr>    <td>      &nbsp;    </td>    <td><p>Check if a low-level binary tree is a root. <p><dl compact><dt><b>Note:</b></dt><dd>Complexity: O( 1 ) </dd></dl><dl compact><dt><b>Precondition:</b></dt><dd>T must be a non-empty _gdsl_bintree_t. </dd></dl><dl compact><dt><b>Parameters:</b></dt><dd>  <table border="0" cellspacing="2" cellpadding="0">    <tr><td valign="top"></td><td valign="top"><em>T</em>&nbsp;</td><td>The low-level binary tree to check. </td></tr>  </table></dl><dl compact><dt><b>Returns:</b></dt><dd>TRUE if the low-level binary tree T is a root. <p>FALSE if the low-level binary tree T is not a root. </dd></dl><dl compact><dt><b>See also:</b></dt><dd><a class="el" href="group____gdsl__bintree.html#g78d1edf127bc12942a83b6add1f6d642">_gdsl_bintree_is_empty()</a> <p><a class="el" href="group____gdsl__bintree.html#g0d50a9326725a116e2d0a02074e3b0f5">_gdsl_bintree_is_leaf()</a> </dd></dl>    </td>  </tr></table><a class="anchor" name="gebb3e893391278b393ea34c752bc3a3f"></a><!-- doxytag: member="_gdsl_bintree.h::_gdsl_bintree_get_content" ref="gebb3e893391278b393ea34c752bc3a3f" args="(const _gdsl_bintree_t T)" --><p><table class="mdTable" cellpadding="2" cellspacing="0">  <tr>    <td class="mdRow">      <table cellpadding="0" cellspacing="0" border="0">        <tr>          <td class="md" nowrap valign="top"><a class="el" href="group__gdsl__types.html#g0e2b9d7fb5ca9e6d50100e5d9e4bcae7">gdsl_element_t</a> _gdsl_bintree_get_content           </td>          <td class="md" valign="top">(&nbsp;</td>          <td class="md" nowrap valign="top">const <a class="el" href="group____gdsl__bintree.html#g797c557a551a057c0763387ce7b92fbe">_gdsl_bintree_t</a>&nbsp;</td>          <td class="mdname1" valign="top" nowrap> <em>T</em>          </td>          <td class="md" valign="top">&nbsp;)&nbsp;</td>          <td class="md" nowrap></td>        </tr>      </table>    </td>  </tr></table><table cellspacing="5" cellpadding="0" border="0">  <tr>    <td>      &nbsp;    </td>    <td><p>Get the root content of a low-level binary tree. <p><dl compact><dt><b>Note:</b></dt><dd>Complexity: O( 1 ) </dd></dl><dl compact><dt><b>Precondition:</b></dt><dd>T must be a non-empty _gdsl_bintree_t. </dd></dl><dl compact><dt><b>Parameters:</b></dt><dd>  <table border="0" cellspacing="2" cellpadding="0">    <tr><td valign="top"></td><td valign="top"><em>T</em>&nbsp;</td><td>The low-level binary tree to use. </td></tr>  </table></dl><dl compact><dt><b>Returns:</b></dt><dd>the root's content of the low-level binary tree T. </dd></dl><dl compact><dt><b>See also:</b></dt><dd><a class="el" href="group____gdsl__bintree.html#g508b48820f2d5b8d6a1047abc2884fd0">_gdsl_bintree_set_content()</a> </dd></dl>    </td>  </tr></table><a class="anchor" name="g473ac7a29cb71556885980f3b6a45daa"></a><!-- doxytag: member="_gdsl_bintree.h::_gdsl_bintree_get_parent" ref="g473ac7a29cb71556885980f3b6a45daa" args="(const _gdsl_bintree_t T)" --><p><table class="mdTable" cellpadding="2" cellspacing="0">  <tr>    <td class="mdRow">      <table cellpadding="0" cellspacing="0" border="0">        <tr>          <td class="md" nowrap valign="top"><a class="el" href="group____gdsl__bintree.html#g797c557a551a057c0763387ce7b92fbe">_gdsl_bintree_t</a> _gdsl_bintree_get_parent           </td>          <td class="md" valign="top">(&nbsp;</td>          <td class="md" nowrap valign="top">const <a class="el" href="group____gdsl__bintree.html#g797c557a551a057c0763387ce7b92fbe">_gdsl_bintree_t</a>&nbsp;</td>          <td class="mdname1" valign="top" nowrap> <em>T</em>          </td>          <td class="md" valign="top">&nbsp;)&nbsp;</td>          <td class="md" nowrap></td>        </tr>      </table>    </td>  </tr></table><table cellspacing="5" cellpadding="0" border="0">  <tr>    <td>      &nbsp;    </td>    <td><p>Get the parent tree of a low-level binary tree. <p><dl compact><dt><b>Note:</b></dt><dd>Complexity: O( 1 ) </dd></dl><dl compact><dt><b>Precondition:</b></dt><dd>T must be a non-empty _gdsl_bintree_t. </dd></dl><dl compact><dt><b>Parameters:</b></dt><dd>  <table border="0" cellspacing="2" cellpadding="0">    <tr><td valign="top"></td><td valign="top"><em>T</em>&nbsp;</td><td>The low-level binary tree to use. </td></tr>  </table></dl><dl compact><dt><b>Returns:</b></dt><dd>the parent of the low-level binary tree T if T isn't a root. <p>NULL if the low-level binary tree T is a root (ie. T has no parent). </dd></dl><dl compact><dt><b>See also:</b></dt><dd><a class="el" href="group____gdsl__bintree.html#gc66dabdae780172e64264eb4065ef156">_gdsl_bintree_is_root()</a> <p><a class="el" href="group____gdsl__bintree.html#ga332306828fd20d27a9af6ca52dde013">_gdsl_bintree_set_parent()</a> </dd></dl>    </td>  </tr></table><a class="anchor" name="g7cd6ff95966f0dfe1db04d905c40addc"></a><!-- doxytag: member="_gdsl_bintree.h::_gdsl_bintree_get_left" ref="g7cd6ff95966f0dfe1db04d905c40addc" args="(const _gdsl_bintree_t T)" --><p><table class="mdTable" cellpadding="2" cellspacing="0">  <tr>    <td class="mdRow">      <table cellpadding="0" cellspacing="0" border="0">        <tr>          <td class="md" nowrap valign="top"><a class="el" href="group____gdsl__bintree.html#g797c557a551a057c0763387ce7b92fbe">_gdsl_bintree_t</a> _gdsl_bintree_get_left           </td>          <td class="md" valign="top">(&nbsp;</td>          <td class="md" nowrap valign="top">const <a class="el" href="group____gdsl__bintree.html#g797c557a551a057c0763387ce7b92fbe">_gdsl_bintree_t</a>&nbsp;</td>          <td class="mdname1" valign="top" nowrap> <em>T</em>          </td>          <td class="md" valign="top">&nbsp;)&nbsp;</td>          <td class="md" nowrap></td>        </tr>      </table>    </td>  </tr></table><table cellspacing="5" cellpadding="0" border="0">  <tr>    <td>      &nbsp;    </td>    <td><p>Get the left sub-tree of a low-level binary tree. <p>Return the left subtree of the low-level binary tree T (noted l(T)).<p><dl compact><dt><b>Note:</b></dt><dd>Complexity: O( 1 ) </dd></dl><dl compact><dt><b>Precondition:</b></dt><dd>T must be a non-empty _gdsl_bintree_t. </dd></dl><dl compact><dt><b>Parameters:</b></dt><dd>  <table border="0" cellspacing="2" cellpadding="0">    <tr><td valign="top"></td><td valign="top"><em>T</em>&nbsp;</td><td>The low-level binary tree to use. </td></tr>  </table></dl><dl compact><dt><b>Returns:</b></dt><dd>the left sub-tree of the low-level binary tree T if T has a left sub-tree. <p>NULL if the low-level binary tree T has no left sub-tree. </dd></dl><dl compact><dt><b>See also:</b></dt><dd><a class="el" href="group____gdsl__bintree.html#g6412e383427d791a9bfe4739b9ec198e">_gdsl_bintree_get_right()</a> <p><a class="el" href="group____gdsl__bintree.html#g55ab5813c249066509f7516ab308d34d">_gdsl_bintree_set_left()</a> <p><a class="el" href="group____gdsl__bintree.html#gd0e00123c4e733862b20512d4edd8e75">_gdsl_bintree_set_right()</a> </dd></dl>    </td>  </tr></table><a class="anchor" name="g6412e383427d791a9bfe4739b9ec198e"></a><!-- doxytag: member="_gdsl_bintree.h::_gdsl_bintree_get_right" ref="g6412e383427d791a9bfe4739b9ec198e" args="(const _gdsl_bintree_t T)" --><p><table class="mdTable" cellpadding="2" cellspacing="0">  <tr>    <td class="mdRow">      <table cellpadding="0" cellspacing="0" border="0">        <tr>          <td class="md" nowrap valign="top"><a class="el" href="group____gdsl__bintree.html#g797c557a551a057c0763387ce7b92fbe">_gdsl_bintree_t</a> _gdsl_bintree_get_right           </td>          <td class="md" valign="top">(&nbsp;</td>          <td class="md" nowrap valign="top">const <a class="el" href="group____gdsl__bintree.html#g797c557a551a057c0763387ce7b92fbe">_gdsl_bintree_t</a>&nbsp;</td>          <td class="mdname1" valign="top" nowrap> <em>T</em>          </td>          <td class="md" valign="top">&nbsp;)&nbsp;</td>          <td class="md" nowrap></td>        </tr>      </table>    </td>  </tr>

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -