bt_put.m
来自「data structures C programs」· M 代码 · 共 44 行
M
44 行
function bt=bt_put(bt,data,key)
% BT_PUT
%
% bt=BT_PUT(bt,data,key) inserts data in the binary tree bt.
% The binary tree is sorted according to a key.
% Copyright (c) MathWorks Inc. 1998-2001. All rights reserved.
global bt_nil
node=bt;
parent=bt_nil;
while node~=bt_nil
nodekey=node.key;
if key==nodekey
return
end
parent=node;
if key<nodekey
node=node.left;
else
node=node.right;
end
end
node=pointer;
node.key=key;
node.data=data;
node.left=bt_nil;
node.right=bt_nil;
if parent==bt_nil
bt=node;
else
if key<parent.key
parent.left=node;
else
parent.right=node;
end
end
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?