📄 page299.html
字号:
<HTML><HEAD><TITLE>Basics</TITLE></HEAD><BODY bgcolor="#FFFFFF"> <a href="../index.html" target="_top"><img src="../icons/usins.gif" alt="Logo" align=right></a><b>Data Structures and Algorithms with Object-Oriented Design Patterns in Python</b><br><A NAME="tex2html4647" HREF="page300.html"><IMG WIDTH=37 HEIGHT=24 ALIGN=BOTTOM ALT="next" SRC="../icons/next_motif.gif"></A> <A NAME="tex2html4645" HREF="page298.html"><IMG WIDTH=26 HEIGHT=24 ALIGN=BOTTOM ALT="up" SRC="../icons/up_motif.gif"></A> <A NAME="tex2html4639" HREF="page298.html"><IMG WIDTH=63 HEIGHT=24 ALIGN=BOTTOM ALT="previous" SRC="../icons/previous_motif.gif"></A> <A NAME="tex2html4649" HREF="page611.html"><IMG WIDTH=43 HEIGHT=24 ALIGN=BOTTOM ALT="index" SRC="../icons/index_motif.gif"></A> <BR><HR><H1><A NAME="SECTION0010100000000000000000">Basics</A></H1><P>A tree which supports efficient search, insertion, and withdrawaloperations is called a <em>search tree</em><A NAME=18021> </A>.In this context the tree is used to store a finite set of keysdrawn from a totally ordered set of keys <I>K</I>.Each node of the tree contains one or more keysand all the keys in the tree are unique,i.e., no duplicate keys are permitted.<P>What makes a tree into a search tree is that the keysdo not appear in arbitrary nodes of the tree.Instead, there is a<em>data ordering criterion</em>which determines where a given key may appear in the treein relation to the other keys in that tree.The following sections present two related types of search trees,<I>M</I>-way search trees and binary search trees.<P><BR> <HR><UL> <LI> <A NAME="tex2html4650" HREF="page300.html#SECTION0010110000000000000000"><I>M</I>-Way Search Trees</A><LI> <A NAME="tex2html4651" HREF="page301.html#SECTION0010120000000000000000">Binary Search Trees</A></UL><HR><A NAME="tex2html4647" HREF="page300.html"><IMG WIDTH=37 HEIGHT=24 ALIGN=BOTTOM ALT="next" SRC="../icons/next_motif.gif"></A> <A NAME="tex2html4645" HREF="page298.html"><IMG WIDTH=26 HEIGHT=24 ALIGN=BOTTOM ALT="up" SRC="../icons/up_motif.gif"></A> <A NAME="tex2html4639" HREF="page298.html"><IMG WIDTH=63 HEIGHT=24 ALIGN=BOTTOM ALT="previous" SRC="../icons/previous_motif.gif"></A> <A NAME="tex2html4649" HREF="page611.html"><IMG WIDTH=43 HEIGHT=24 ALIGN=BOTTOM ALT="index" SRC="../icons/index_motif.gif"></A> <P><ADDRESS><img src="../icons/bruno.gif" alt="Bruno" align=right><a href="../copyright.html">Copyright © 2003</a> by <a href="../signature.html">Bruno R. Preiss, P.Eng.</a> All rights reserved.</ADDRESS></BODY></HTML>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -