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
6.1 Definition Definition: A queue is a linear list in which additions and deletions take place at different ends. It is also called a first-in-first-out list. The end at which new elements are added is called the rear. The end from which old elements are deleted is called the front
5.1 definition of stack Definition A stack is a linear list in which insertions and deletions take place at the same end. This end is called the top. The other end of the list is called the bottom. It is also called a LIFO(last-in-first-out) list
1. Hemoglobin is a multisubunit allosteric rotein that carries 02 in erythrocyte. 1.1 Hemoglobin is a well-studied and well-understood protein. 1.1.1 It was one of the first proteins to have its molecular mass accurately determined. 1.1.2 The first protein to be characterized by ultracentrifuge. 1.1.3 The first protein to be associated with a specific physiological function
1. The nucleic acids, deoxyribonucleic acid (DNA) and ribonucleic acid (RNA), are polymers of nucleotide units 1.1 DNA consists of four kinds of deoxyribonucleotide units linked together through covalent bonds 1.1.1 Each nucleotide unit is made of a nitrogenous base (the various part in the four different deoxyribonucleotides), a pentose sugar and a phosphate group
