demo_c_trees.htm

来自「Delphi脚本控件」· HTM 代码 · 共 106 行

HTM
106 行
字号 
<html>
<head>
<link rel=stylesheet type="text/css" href="styles.css">
</head>

<body>

<h3>
LISPPA: Binary trees (paxC).
</h3>
<hr>

<blockquote>
<pre>
<font color="blue"><b>int</b></font> Key = 0, Left = 1, Right = 2;

<font color="blue"><b>void</b></font> AddNode(<font color="blue"><b>variant</b></font> Root, <font color="blue"><b>variant</b></font> X){
  <font color="blue"><b>if</b></font> (Root == <font color="blue"><b>NULL</b></font>)
    Root = [X, <font color="blue"><b>NULL</b></font>, <font color="blue"><b>NULL</b></font>];
  <font color="blue"><b>else</b></font> <font color="blue"><b>if</b></font> (X < Root[Key])
    AddNode(& Root[Left], X);
  <font color="blue"><b>else</b></font> <font color="blue"><b>if</b></font> (X > Root[Key])
    AddNode(& Root[Right], X);
}

<font color="blue"><b>variant</b></font> Search(Root, X){
  <font color="blue"><b>if</b></font> (Root == <font color="blue"><b>NULL</b></font>)
    <font color="blue"><b>return</b></font> <font color="blue"><b>NULL</b></font>;
  <font color="blue"><b>else</b></font> <font color="blue"><b>if</b></font> (X == Root[Key])
    <font color="blue"><b>return</b></font> Root;
  <font color="blue"><b>else</b></font> <font color="blue"><b>if</b></font> (X < Root[Key])
    <font color="blue"><b>return</b></font> Search(Root[Left], X);
  <font color="blue"><b>else</b></font>
    <font color="blue"><b>return</b></font> Search(Root[Right], X);
}

<font color="blue"><b>void</b></font> DeleteNode(<font color="blue"><b>variant</b></font> Root, <font color="blue"><b>variant</b></font> X){
  <font color="blue"><b>variant</b></font> P, R;
  R = Search(Root, X);

  <font color="blue"><b>if</b></font> (R == <font color="blue"><b>NULL</b></font>) <font color="blue"><b>return</b></font>;

  <font color="blue"><b>if</b></font> ((R[Left] == <font color="blue"><b>NULL</b></font>) && (R[Right] == <font color="blue"><b>NULL</b></font>))
    <font color="blue"><b>reduced</b></font> R = <font color="blue"><b>NULL</b></font>;
  <font color="blue"><b>else</b></font> <font color="blue"><b>if</b></font> (R[Left] == <font color="blue"><b>NULL</b></font>)
    <font color="blue"><b>reduced</b></font> R = R[Right];
  <font color="blue"><b>else</b></font> <font color="blue"><b>if</b></font> (R[Right] == <font color="blue"><b>NULL</b></font>)
    <font color="blue"><b>reduced</b></font> R = R[Left];
  <font color="blue"><b>else</b></font> {
    P = & R[Left];
    <font color="blue"><b>while</b></font> (P[Right] != <font color="blue"><b>NULL</b></font>) { P = & P[Right]; };
    R[Key] = P[Key];
    <font color="blue"><b>reduced</b></font> P = P[Left];
  }
}

<font color="blue"><b>void</b></font> PreOrder(<font color="blue"><b>variant</b></font> Root){
  <font color="blue"><b>if</b></font> (Root == <font color="blue"><b>NULL</b></font>) <font color="blue"><b>return</b></font>;
  <font color="blue"><b>println</b></font> Root[Key];
  PreOrder(Root[Left]);
  PreOrder(Root[Right]);
}

<font color="blue"><b>void</b></font> InOrder(<font color="blue"><b>variant</b></font> Root){
  <font color="blue"><b>if</b></font> (Root == <font color="blue"><b>NULL</b></font>) <font color="blue"><b>return</b></font>;
  InOrder(Root[Left]);
  <font color="blue"><b>println</b></font> Root[Key];
  InOrder(Root[Right]);
}

<font color="blue"><b>void</b></font> PostOrder(<font color="blue"><b>variant</b></font> Root){
  <font color="blue"><b>if</b></font> (Root == <font color="blue"><b>NULL</b></font>) <font color="blue"><b>return</b></font>;
  PostOrder(Root[Right]);
  PostOrder(Root[Left]);
  <font color="blue"><b>println</b></font> Root[Key];
}

<font color="blue"><b>variant</b></font> Tree, X;

AddNode(&Tree, 10);
AddNode(&Tree, 5);
AddNode(&Tree, 15);
AddNode(&Tree, 3);
AddNode(&Tree, 8);
AddNode(&Tree, 13);
AddNode(&Tree, 18);
<font color="blue"><b>println</b></font> Tree;
InOrder(Tree);

X = Search(Tree, 5);
<font color="blue"><b>println</b></font> X;

DeleteNode(&Tree, 10);
<font color="blue"><b>println</b></font> Tree;
</pre>
</blockquote>

<p>
<HR>
<font size = 1 color ="gray">
Copyright &copy; 1999-2005
VIRT Laboratory. All rights reserved.
</font>
</body>
</html>

demo_c_trees.htm - 源码说明

本页面展示了「Delphi脚本控件」中的 demo_c_trees.htm 源码文件，采用 HTM 编程语言编写，共 106 行代码。您可以在线阅读完整代码内容，也可以返回资源详情页下载完整源码包进行本地学习和开发。

虫虫下载站收录了大量与Delphi相关的技术资源，包括源代码、技术文档、电路图等，是电子工程师和嵌入式开发者的专业学习平台。

⌨️ 快捷键说明

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