11.1 Binary Search Trees 1.Definition: A binary search tree is a binary tree that may be empty. nonempty binary search tree satisfies the following properties: 1)Every element has a key and no two elements have the same key: therefore,all keys are distinct
7.1 Dictionaries A dictionary is a collection of elements each element has a field called key, and no two elements have the same key value. Operations: Insert(x): insert an element with a specified key value Search(k,x): search an element with a specified key
3.1 Preface 1. data object--- a set of instances or values for example: Boolean={ false,true} Digit={0,1,2,3,4,5,6,7,8,9} Letter={A, B, ....., a,b, ..... Z} NaturalNumber= {0, 1,2, ..... Integer={0,+1,-1,+2,-2,+3,-3,} String={a,, ..... ,aa, ab, ac