二叉树在Delphi中的实现
首先我写了这张唱片:二叉树在Delphi中的实现,delphi,pointers,tree,Delphi,Pointers,Tree,首先我写了这张唱片: type PNode = ^Tree; Tree = record key : Integer; left,right : PNode; end; function TForm1.TreeInit(key: Integer): PNode; var Head : PNode; begin Head := nil; New(Head); Head.key := key; Head.right := nil; Head.left := nil;
type
PNode = ^Tree;
Tree = record
key : Integer;
left,right : PNode;
end;
function TForm1.TreeInit(key: Integer): PNode;
var
Head : PNode;
begin
Head := nil;
New(Head);
Head.key := key;
Head.right := nil;
Head.left := nil;
Result := Head;
end;
一切都很好。然后,我将父对象添加到结构中:
type
PNode = ^Tree;
Tree = record
key : Integer;
left,right : PNode;
parent : PNode;
end;
现在我不知道如何&在哪里可以初始化父级(特别是在插入函数中)
插入函数:
function TForm1.NodeInsert(Head: PNode; key: Integer): PNode;
begin
if Head = nil then
begin
Result := TreeInit(key);
end else
begin
if (Head.key > key) then
Head.left := NodeInsert(Head.left, key)
else
Head.right := NodeInsert(Head.right,key);
Result := Head;
end;
end;
我不明白为什么要将这些方法做成GUI形式,因为它们与GUI无关。这些应该是独立的过程 初始化函数可以这样简单地编写:
function NewNode(key: Integer; parent: PNode): PNode;
begin
New(Result);
Result.key := key;
Result.right := nil;
Result.left := nil;
Result.parent := parent;
end;
procedure InsertNode(node: PNode: key: Integer);
begin
if key < node.key then
if Assigned(node.left) then
InsertNode(node.left, key)
else
node.left := NewNode(key, node)
else
if Assigned(node.right) then
InsertNode(node.right, key)
else
node.right := NewNode(key, node)
end;
procedure Add(var head: PNode; key: Integer);
begin
if Assigned(head) then
InsertNode(head, key)
else
head := NewNode(key, nil)
end;
至于插入,通常会这样做:
function NewNode(key: Integer; parent: PNode): PNode;
begin
New(Result);
Result.key := key;
Result.right := nil;
Result.left := nil;
Result.parent := parent;
end;
procedure InsertNode(node: PNode: key: Integer);
begin
if key < node.key then
if Assigned(node.left) then
InsertNode(node.left, key)
else
node.left := NewNode(key, node)
else
if Assigned(node.right) then
InsertNode(node.right, key)
else
node.right := NewNode(key, node)
end;
procedure Add(var head: PNode; key: Integer);
begin
if Assigned(head) then
InsertNode(head, key)
else
head := NewNode(key, nil)
end;
如果您想避免递归,这很容易:
procedure InsertNode(node: PNode: key: Integer);
begin
while True do
if key < node.key then
if Assigned(node.left) then
node := node.left
else
begin
node.left := NewNode(key, node);
exit;
end
else
if Assigned(node.right) then
node := node.right
else
begin
node.right := NewNode(key, node);
exit;
end
end;
procedure-InsertNode(节点:PNode:key:Integer);
开始
尽管如此
如果key
然后很容易合并到单独的Add函数中
procedure InsertNode(var head: PNode: key: Integer);
var
node: PNode;
begin
if not Assigned(head) then
begin
head := NewNode(key, nil);
exit;
end;
node := head;
while True do
if key < node.key then
if Assigned(node.left) then
node := node.left
else
begin
node.left := NewNode(key, node);
exit;
end
else
if Assigned(node.right) then
node := node.right
else
begin
node.right := NewNode(key, node);
exit;
end
end;
过程插入节点(变量头:PNode:键:整数);
变量
节点:PNode;
开始
如果未分配(头),则
开始
head:=NewNode(key,nil);
出口
终止
节点:=头部;
尽管如此
如果key
我不明白为什么要将这些方法制作成GUI表单,因为它们与GUI无关。这些应该是独立的过程
初始化函数可以这样简单地编写:
function NewNode(key: Integer; parent: PNode): PNode;
begin
New(Result);
Result.key := key;
Result.right := nil;
Result.left := nil;
Result.parent := parent;
end;
procedure InsertNode(node: PNode: key: Integer);
begin
if key < node.key then
if Assigned(node.left) then
InsertNode(node.left, key)
else
node.left := NewNode(key, node)
else
if Assigned(node.right) then
InsertNode(node.right, key)
else
node.right := NewNode(key, node)
end;
procedure Add(var head: PNode; key: Integer);
begin
if Assigned(head) then
InsertNode(head, key)
else
head := NewNode(key, nil)
end;
至于插入,通常会这样做:
function NewNode(key: Integer; parent: PNode): PNode;
begin
New(Result);
Result.key := key;
Result.right := nil;
Result.left := nil;
Result.parent := parent;
end;
procedure InsertNode(node: PNode: key: Integer);
begin
if key < node.key then
if Assigned(node.left) then
InsertNode(node.left, key)
else
node.left := NewNode(key, node)
else
if Assigned(node.right) then
InsertNode(node.right, key)
else
node.right := NewNode(key, node)
end;
procedure Add(var head: PNode; key: Integer);
begin
if Assigned(head) then
InsertNode(head, key)
else
head := NewNode(key, nil)
end;
如果您想避免递归,这很容易:
procedure InsertNode(node: PNode: key: Integer);
begin
while True do
if key < node.key then
if Assigned(node.left) then
node := node.left
else
begin
node.left := NewNode(key, node);
exit;
end
else
if Assigned(node.right) then
node := node.right
else
begin
node.right := NewNode(key, node);
exit;
end
end;
procedure-InsertNode(节点:PNode:key:Integer);
开始
尽管如此
如果key
然后很容易合并到单独的Add函数中
procedure InsertNode(var head: PNode: key: Integer);
var
node: PNode;
begin
if not Assigned(head) then
begin
head := NewNode(key, nil);
exit;
end;
node := head;
while True do
if key < node.key then
if Assigned(node.left) then
node := node.left
else
begin
node.left := NewNode(key, node);
exit;
end
else
if Assigned(node.right) then
node := node.right
else
begin
node.right := NewNode(key, node);
exit;
end
end;
过程插入节点(变量头:PNode:键:整数);
变量
节点:PNode;
开始
如果未分配(头),则
开始
head:=NewNode(key,nil);
出口
终止
节点:=头部;
尽管如此
如果key
通过修复代码缩进,我提高了可读性。请下次使用一些代码格式化工具来做这件事。插入函数在哪里?我想通过父指针实现树后继。我通过修复代码缩进提高了可读性。请下次使用一些代码格式化工具来完成。插入函数在哪里?我想通过父指针实现树的后续函数。