Binary Search Trees

CS 302 – Data Structures

Chapter 8
 What is a binary tree?
• Property 1: each node can have up to two
successor nodes.
 What is a binary tree? (cont.)
• Property 2: a unique path exists from the
root to every other node

Not a valid binary tree!

 Some terminology
• The successor nodes of a node are called its children
• The predecessor node of a node is called its parent
• The "beginning" node is called the root (has no parent)
• A node without children is called a leaf
 Some terminology (cont’d)
• Nodes are organize in levels (indexed from 0).

• Level (or depth) of a node: number of edges in the path from

the root to that node.

not full!
• Height of a tree h: #levels = L
(Warning: some books define h
as #levels-1).

• Full tree: every node has exactly

two children and all the
leaves are on the same level.
 What is the max #nodes
at some level l?
The max #nodes at level l is 2l where l=0,1,2, ...,L-1

 20
 21
 22
 23
What is the total #nodes N
of a full tree with height h?

h 1
N  2  2  ...  2
0 1
 2 1
h
l=0 l=1 l=h-1

using the geometric series:

n 1
x  x  ...  x
0 1 n 1
 x  i x n 1
x 1
i 0
 What is the height h
of a full tree with N nodes?

2 1  N
h

 2  N 1
h

 h  log( N  1)  O(log N )
 Why is h important?
• Tree operations (e.g., insert, delete, retrieve
etc.) are typically expressed in terms of h.

• So, h determines running time!

•What is the max height of a tree with
N nodes? N (same as a linked list)

•What is the min height of a tree with

N nodes? log(N+1)
 How to search a binary tree?
(1) Start at the root
(2) Search the tree level
by level, until you find
the element you are
searching for or you reach
a leaf.

Is this better than searching a linked list?

No  O(N)
 Binary Search Trees (BSTs)
• Binary Search Tree Property:
The value stored at
a node is greater than
the value stored at its
left child and less than
the value stored at its
right child
 Binary Search Trees (BSTs)

In a BST, the value

stored at the root of
a subtree is greater
than any value in its
left subtree and less
than any value in its
right subtree!
 Binary Search Trees (BSTs)

Where is the
smallest element?
Ans: leftmost element

Where is the largest

element?
Ans: rightmost element
How to search a binary search tree?
(1) Start at the root
(2) Compare the value of
the item you are
searching for with
the value stored at
the root
(3) If the values are
equal, then item
found; otherwise, if it
is a leaf node, then
not found
How to search a binary search tree?
(4) If it is less than the value
stored at the root, then
search the left subtree
(5) If it is greater than the
value stored at the root,
then search the right
subtree
(6) Repeat steps 2-6 for the
root of the subtree chosen
in the previous step 4 or 5
How to search a binary search tree?

Is this better than searching

a linked list?

Yes !! ---> O(logN)

Tree node structure

template<class ItemType>
struct TreeNode<ItemType> {
ItemType info;
TreeNode<ItemType>* left;
TreeNode<ItemType>* right;
};
Binary Search Tree Specification
#include <fstream.h>
 
struct TreeNode<ItemType>;
 
enum OrderType {PRE_ORDER, IN_ORDER, POST_ORDER};
 
template<class ItemType>
class TreeType {
public:
TreeType();
~TreeType();
TreeType(const TreeType<ItemType>&);
void operator=(const TreeType<ItemType>&);
void MakeEmpty();
bool IsEmpty() const;
bool IsFull() const;
int NumberOfNodes() const;
Binary Search Tree Specification
(cont.)
void RetrieveItem(ItemType&, bool& found);
void InsertItem(ItemType);
void DeleteItem(ItemType);
void ResetTree(OrderType);
void GetNextItem(ItemType&, OrderType, bool&);
void PrintTree(ofstream&) const;
private:
TreeNode<ItemType>* root;
};
 
 Function NumberOfNodes
• Recursive implementation
#nodes in a tree =
#nodes in left subtree + #nodes in right subtree + 1

• What is the size factor?

Number of nodes in the tree we are examining
• What is the base case?
The tree is empty
• What is the general case?
CountNodes(Left(tree)) + CountNodes(Right(tree)) + 1
 Function NumberOfNodes
template<class ItemType>
(cont.)
int TreeType<ItemType>::NumberOfNodes() const
{
return CountNodes(root);
}
 
template<class ItemType>
int CountNodes(TreeNode<ItemType>* tree)
{
if (tree == NULL) Running Time?
return 0;
else
O(N)
return CountNodes(tree->left) + CountNodes(tree->right) + 1;
}
Function RetrieveItem
 Function RetrieveItem
• What is the size of the problem?
Number of nodes in the tree we are examining
• What is the base case(s)?
1) When the key is found
2) The tree is empty (key was not found)
• What is the general case?
Search in the left or right subtrees
 Function RetrieveItem (cont.)
template <class ItemType>
void TreeType<ItemType>:: RetrieveItem(ItemType& item, bool& found)
{
Retrieve(root, item, found);
}
 

template<class ItemType>
void Retrieve(TreeNode<ItemType>* tree, ItemType& item, bool& found)
{
if (tree == NULL) // base case 2
found = false;
else if(item < tree->info)
Retrieve(tree->left, item, found);
Running Time?
else if(item > tree->info)
Retrieve(tree->right, item, found);
O(h)
else { // base case 1
item = tree->info;
found = true;
}
}
 Function
InsertItem
• Use the
binary search
tree property
to insert the
new item at
the correct
place
 Function
InsertItem
(cont.)
• Implementing
insertion
resursively
e.g., insert 11
 Function InsertItem (cont.)
• What is the size of the problem?
Number of nodes in the tree we are examining
• What is the base case(s)?
The tree is empty
• What is the general case?
Choose the left or right subtree
Function InsertItem (cont.)
template<class ItemType>
void TreeType<ItemType>::InsertItem(ItemType item)
{
Insert(root, item);
}
 
template<class ItemType>
void Insert(TreeNode<ItemType>*& tree, ItemType item)
{
if(tree == NULL) { // base case
tree = new TreeNode<ItemType>;
tree->right = NULL;
tree->left = NULL;
tree->info = item;
} Running Time?
else if(item < tree->info)
Insert(tree->left, item); O(h)
else
Insert(tree->right, item);
}
Function InsertItem (cont.)
Insert 11
 Does the order of inserting
elements into a tree matter?
• Yes, certain orders might produce very
unbalanced trees!
Does the
order of
inserting
elements
into a tree
matter?
(cont.)
 Does the order of inserting
elements into a tree matter?
(cont’d)
• Unbalanced trees are not desirable because
search time increases!
• Advanced tree structures, such as red-black
trees, guarantee balanced trees.
 Function DeleteItem

• First, find the item; then, delete it

• Binary search tree property must be
preserved!!
• We need to consider three different cases: 
(1) Deleting a leaf
(2) Deleting a node with only one child
(3) Deleting a node with two children
(1) Deleting a leaf
(2) Deleting a node with
only one child
(3) Deleting a node with two
children
(3) Deleting a node with two
children (cont.)
• Find predecessor (i.e., rightmost node in the
left subtree)
• Replace the data of the node to be deleted
with predecessor's data
• Delete predecessor node
 Function DeleteItem (cont.)
• What is the size of the problem?
Number of nodes in the tree we are examining
• What is the base case(s)?
Key to be deleted was found
• What is the general case?
Choose the left or right subtree
 Function DeleteItem (cont.)
template<class ItemType>
void TreeType<ItmeType>::DeleteItem(ItemType item)
{
Delete(root, item);
}
 
template<class ItemType>
void Delete(TreeNode<ItemType>*& tree, ItemType item)
{
if(item < tree->info)
Delete(tree->left, item);
else if(item > tree->info)
Delete(tree->right, item);
else
DeleteNode(tree);
}
 Function DeleteItem (cont.)
template <class ItemType>
void DeleteNode(TreeNode<ItemType>*& tree)
{
ItemType item;
TreeNode<ItemType>* tempPtr;
 
tempPtr = tree;
if(tree->left == NULL) { // right child
tree = tree->right;
delete tempPtr; 0 children or
} 1 child
else if(tree->right == NULL) { // left child
tree = tree->left;
delete tempPtr; 0 children or
}
else { 1 child
GetPredecessor(tree->left, item);
tree->info = item;
Delete(tree->left, item); 2 children
}
}
 Function DeleteItem (cont.)
template<class ItemType>
void GetPredecessor(TreeNode<ItemType>* tree, ItemType& item)
{
while(tree->right != NULL)
tree = tree->right;
item = tree->info;
}
 Function DeleteItem (cont.)
template<class ItemType>
void TreeType<ItmeType>::DeleteItem(ItemType item)
{
Delete(root, item);
}
 
template<class ItemType>
void Delete(TreeNode<ItemType>*& tree, ItemType item)
{
if(item < tree->info)
Delete(tree->left, item);
else if(item > tree->info) Running Time?
Delete(tree->right, item);
else
DeleteNode(tree); O(h)
}
Function DeleteItem (cont.)
 Tree Traversals
There are mainly three ways to traverse a tree:
1) Inorder Traversal
2) Postorder Traversal
3) Preorder Traversal
 Inorder Traversal: A E H J M T Y
Visit second
tree

‘J’

‘E’ ‘T’

‘A’ ‘H’ ‘M’ ‘Y’

Visit left subtree first Visit right subtree last

46
 Inorder Traversal
• Visit the nodes in the left subtree, then visit
the root of the tree, then visit the nodes in
the right subtree
Inorder(tree)
 

If tree is not NULL

Inorder(Left(tree))
Visit Info(tree)
Inorder(Right(tree))

Warning:
Warning "visit" implies do something with the value at
the node (e.g., print, save, update etc.).
Preorder Traversal: J E A H T M Y
Visit first
tree

‘J’

‘E’ ‘T’

‘A’ ‘H’ ‘M’ ‘Y’

Visit left subtree second Visit right subtree last

48
 Preorder Traversal
• Visit the root of the tree first, then visit the
nodes in the left subtree, then visit the
nodes in the right subtree
Preorder(tree)
If tree is not NULL
Visit Info(tree)
Preorder(Left(tree))
Preorder(Right(tree))
Postorder Traversal: A H E M Y T J
Visit last
tree

‘J’

‘E’ ‘T’

‘A’ ‘H’ ‘M’ ‘Y’

Visit left subtree first Visit right subtree second

50
 Postorder Traversal
• Visit the nodes in the left subtree first, then
visit the nodes in the right subtree, then visit
the root of the tree
Postorder(tree)
If tree is not NULL
Postorder(Left(tree))
Postorder(Right(tree))
Visit Info(tree)
 Tree
Traversals:
another
example
 Function PrintTree
• We use "inorder" to print out the node values.
• Keys will be printed out in sorted order.
• Hint: binary search could be used for sorting!

ADJMQRT
 Function PrintTree (cont.)
void TreeType::PrintTree(ofstream& outFile)
{
Print(root, outFile);
}
 
template<class ItemType>
void Print(TreeNode<ItemType>* tree, ofstream& outFile)
{
if(tree != NULL) {
Print(tree->left, outFile);
outFile << tree->info; // “visit”
Print(tree->right, outFile);
}
}
 

to overload “<<“ or “>>”, see:

http://www.fredosaurus.com/notes-cpp/oop-friends/overload-io.html
 Class Constructor
template<class ItemType>
TreeType<ItemType>::TreeType()
{
root = NULL;
}
Class Destructor

How should we
delete the nodes
of a tree?

Use postorder!

Delete the tree in a

"bottom-up"
fashion
 Class Destructor (cont’d)
TreeType::~TreeType()
{
Destroy(root);
}
 

void Destroy(TreeNode<ItemType>*& tree)

{
if(tree != NULL) {
Destroy(tree->left); postorder
Destroy(tree->right);
delete tree; // “visit”

}
}
Copy Constructor

How should we
create a copy of
a tree?

Use preorder!
 Copy Constructor (cont’d)
template<class ItemType>
TreeType<ItemType>::TreeType(const TreeType<ItemType>&
originalTree)
{
CopyTree(root, originalTree.root);
}
 
template<class ItemType)
void CopyTree(TreeNode<ItemType>*& copy,
TreeNode<ItemType>* originalTree)
{
if(originalTree == NULL)
copy = NULL;
else { preorder
copy = new TreeNode<ItemType>;
copy->info = originalTree->info;
// “visit”
CopyTree(copy->left, originalTree->left);
CopyTree(copy->right, originalTree->right);
}
}
 ResetTree and GetNextItem
• User needs to specify the tree
traversal order.
• For efficiency, ResetTree stores in
a queue the results of the
specified tree traversal.
• Then, GetNextItem, dequeues the
node values from the queue.

void ResetTree(OrderType);

void GetNextItem(ItemType&,
OrderType, bool&);
 Trees and
Binary Trees

Become Rich

Force Others Rob Stock

to be Poor Banks Fraud
The class notes are a compilation and edition from many sources. The
instructor does not claim intellectual property or ownership of the lecture
notes.
 Nature View of a Tree
leaves

branche
s root
 Computer Scientist’s View
root

leaves

branches
nodes
•
What
A tree is a finite nonempty set
is a Tree
of elements.
• It is an abstract model of a
Computers”R”Us
hierarchical structure.
• consists of nodes with a
parent-child relation.
• Applications: Sales Manufacturing R&D
– Organization charts
– File systems
– Programming environments
US International Laptops Desktops

Europe Asia Canada

 Tree Terminology
• Root: node without parent (A) Subtree: tree consisting of a
node and its descendants
• Siblings: nodes share the same parent
• Internal node: node with at least one child
(A, B, C, F)
• External node (leaf ): node without children
(E, I, J, K, G, H, D) A
• Ancestors of a node: parent, grandparent,
grand-grandparent, etc.
• Descendant of a node: child, grandchild,
grand-grandchild, etc. B C D
• Depth of a node: number of ancestors
• Height of a tree: maximum depth of any
node (3)
• Degree of a node: the number of its children E F G H
• Degree of a tree: the maximum number of
its node.

I J K

subtree
 Tree Properties
Property Value
A Number of nodes
Height
C Root Node
B
Leaves
Interior nodes
Ancestors of H
D E F
Descendants of B
Siblings of E
Right subtree of A
Degree of this tree
G

H I
 Tree ADT
• We use positions to abstract nodes
• Generic methods:
– integer size()
– boolean isEmpty()
– objectIterator elements()
– positionIterator positions()
• Accessor methods:
– position root()
– position parent(p)
– positionIterator children(p)
Query methods:
boolean isInternal(p)
boolean isExternal(p)
boolean isRoot(p)
Update methods:
swapElements(p, q)
object replaceElement(p, o)
Additional update methods may
be defined by data structures
implementing the Tree ADT
 Intuitive Representation of Tree Node

List Representation
( A ( B ( E ( K, L ), F ), C ( G ), D ( H ( M ), I, J ) ) )
The root comes first, followed by a list of links to sub-trees

How many link fields are needed in

such a representation?

Data Link 1 Link 2 … Link n

 Trees

• Every tree node:

– object – useful information
– children – pointers to its children

Data

Data   Data  Data  

Data   Data   Data  

 A Tree Representation

• A node is represented by an
object storing 
– Element
– Parent node B
– Sequence of children nodes
 

A D F
B

A D F

 
C E
C E
 Left Child, Right Sibling Representation

Data
Left Right
Child Sibling A

B C D

E F G H I

J K L
 Tree Traversal
• Two main methods:
– Preorder
– Postorder
• Recursive definition

• Preorder:
– visit the root
– traverse in preorder the children (subtrees)

• Postorder
– traverse in postorder the children (subtrees)
– visit the root
 Preorder Traversal
• A traversal visits the nodes of a tree in a Algorithm preOrder(v)
systematic manner
visit(v)
• In a preorder traversal, a node is visited
for each child w of v
before its descendants
preorder (w)
• Application: print a structured document

1
Become Rich

2 5 9
1. Motivations 2. Methods 3. Success Stories

3 4 6 7 8
1.1 Enjoy 1.2 Help 2.1 Get a CS 2.2 Start a 2.3 Acquired
Life Poor Friends PhD Web Site by Google
 Postorder Traversal
• In a postorder traversal, a node is Algorithm postOrder(v)
visited after its descendants
for each child w of v
• Application: compute space used by
postOrder (w)
files in a directory and its
subdirectories visit(v)

9
cs16/

8
3 7
todo.txt
homeworks/ programs/
1K

1 2 4 5 6
h1c.doc h1nc.doc DDR.java Stocks.java Robot.java
3K 2K 10K 25K 20K
 Binary Tree
• A binary tree is a tree with the following Applications:
properties: arithmetic expressions
– Each internal node has at most two children
(degree of two) decision processes
– The children of a node are an ordered pair searching

• We call the children of an internal node A

left child and right child

• Alternative recursive definition: a binary

tree is either B C
– a tree consisting of a single node, OR
– a tree whose root has an ordered pair of
children, each of which is a binary tree
D E F G

H I
 BinaryTree ADT
• The BinaryTree ADT extends •
Update methods may be
the Tree ADT, i.e., it inherits defined by data structures
all the methods of the Tree implementing the BinaryTree
ADT ADT
• Additional methods:
– position leftChild(p)
– position rightChild(p)
– position sibling(p)
 Examples of the Binary Tree
Skewed Binary Tree Complete Binary Tree

A 1 A
A

B B 2
B C

C
3 D E F G
D

4 H I
E 5
 Differences Between A Tree and A Binary Tree

• The subtrees of a binary tree are ordered; those of a tree

are not ordered.

A A

B B

• Are different when viewed as binary trees.

• Are the same when viewed as trees.
 Data Structure for Binary Trees
• A node is represented by
an object storing 
– Element
– Parent node
– Left child node B
– Right child node

 

B A D

A D    

C E
C E
 Arithmetic Expression Tree
• Binary tree associated with an arithmetic expression
– internal nodes: operators
– external nodes: operands
• Example: arithmetic expression tree for the expression (2 (a  1) 
(3 b))

 

2  3 b

a 1
 Decision Tree
• Binary tree associated with a decision process
– internal nodes: questions with yes/no answer
– external nodes: decisions
• Example: dining decision

Want a fast meal?

Yes No

How about coffee? On expense account?

Yes No Yes No
Starbucks Spike’s Al Forno Café Paragon
 Maximum Number of Nodes in a
Binary Tree

The maximum number of nodes on depth i of a binary tree is 2i, i>=0.

The maximum nubmer of nodes in a binary tree of height k is 2k+1-1,

k>=0.

Prove by induction.
k

 2 i

i 0
 2 k 1
1
 Full Binary Tree
• A full binary tree of a given height k has 2k+1–1 nodes.

Height 3 full binary tree.

 Labeling Nodes In A Full Binary Tree

• Label the nodes 1 through 2 – 1. k+1

• Label by levels from top to bottom.

• Within a level, label from left to right.
1

2 3

4 5 6 7

8 9 10 11 12 13 14 15
 Node Number Properties
1

2 3

4 5 6 7

8 9 10 11 12 13 14 15

• Parent of node i is node i / 2, unless i = 1.

• Node 1 is the root and has no parent.
 Node Number Properties
1

2 3

4 5 6 7

8 9 10 11 12 13 14 15

• Left child of node i is node 2i, unless 2i > n, where n is the

number of nodes.
• If 2i > n, node i has no left child.
 Node Number Properties
1

2 3

4 5 6 7

8 9 10 11 12 13 14 15

• Right child of node i is node 2i+1, unless 2i+1 > n, where n is

the number of nodes.
• If 2i+1 > n, node i has no right child.
 Complete Binary Trees
A labeled binary tree containing the labels 1 to n with root 1, branches
leading to nodes labeled 2 and 3, branches from these leading to 4, 5 and
6, 7, respectively, and so on.
A binary tree with n nodes and level k is complete iff its nodes
correspond to the nodes numbered from 1 to n in the full binary tree of
level k.

1 1

2 2 3
3

4 5 6 7 4 5 6 7

8 9 10 11 12 13 14 15
8 9
Complete binary tree Full binary tree of depth 3
 Binary Tree Traversals
Let l, R, and r stand for moving left, visiting
the node, and moving right.

There are six possible combinations of traversal

lRr, lrR, Rlr, Rrl, rRl, rlR

Adopt convention that we traverse left before

right, only 3 traversals remain
lRr, lrR, Rlr
inorder, postorder, preorder
 Inorder Traversal
• In an inorder traversal a node is Algorithm inOrder(v)
visited after its left subtree and if isInternal (v)
before its right subtree
inOrder (leftChild (v))
visit(v)
if isInternal (v)
inOrder (rightChild (v))

2 8

1 4 7 9

3 5
 Print Arithmetic Expressions
• Specialization of an inorder traversal Algorithm inOrder (v)
– print operand or operator when if isInternal (v){
visiting node
– print “(“ before traversing left subtree
print(“(’’)
– print “)“ after traversing right subtree inOrder (leftChild
(v))}
print(v.element ())
if isInternal (v){
 inOrder (rightChild
(v))
  print (“)’’)}

2  3 b ((2 (a  1))  (3 b))

a 1
 Evaluate Arithmetic Expressions

• recursive method returning the Algorithm evalExpr(v)

value of a subtree if isExternal (v)
• when visiting an internal node, return v.element ()
combine the values of the
subtrees else
x  evalExpr(leftChild
(v))
y  evalExpr(rightChild
 (v))
  operator stored at v
  return x  y

2  3 2

5 1
 Creativity:
pathLength(tree) =  depth(v) v  tree
Algorithm pathLength(v, n)
Input: a tree node v and an initial value n
Output: the pathLength of the tree with root v
Usage: pl = pathLength(root, 0);

if isExternal (v)
return n
return
(pathLength(leftChild (v), n + 1) +
pathLength(rightChild (v), n + 1) + n)
•
Euler Tour Traversal
Generic traversal of a binary tree
• Includes a special cases the preorder, postorder and inorder traversals
• Walk around the tree and visit each node three times:
– on the left (preorder)
– from below (inorder)
– on the right (postorder)

L  R 
B
2  3 2

5 1
 Euler
eulerTour(node v) {
Tour Traversal
perform action for visiting node on the left;
if v is internal then
eulerTour(v->left);
perform action for visiting node from below;
if v is internal then
eulerTour(v->right);
perform action for visiting node on the right;
}
 Revise Tree Class Specification
enum OrderType {PRE_ORDER, IN_ORDER, POST_ORDER};
 
template<class ItemType>
class TreeType { new member
public: functions
// previous member functions
void PreOrder(TreeNode<ItemType>, QueType<ItemType>&)
void InOrder(TreeNode<ItemType>, QueType<ItemType>&)
void PostOrder(TreeNode<ItemType>, QueType<ItemType>&)
private:
TreeNode<ItemType>* root;
QueType<ItemType> preQue;
QueType<ItemType> inQue; new private data
QueType<ItemType> postQue;
};
 ResetTree and GetNextItem (cont.)

template<class ItemType>
void PreOrder(TreeNode<ItemType>tree,
QueType<ItemType>& preQue)
{
if(tree != NULL) {
preQue.Enqueue(tree->info); // “visit”
PreOrder(tree->left, preQue);
PreOrder(tree->right, preQue);
}
}
 
 ResetTree and GetNextItem (cont.)

template<class ItemType>
void InOrder(TreeNode<ItemType>tree,
QueType<ItemType>& inQue)
{
if(tree != NULL) {
InOrder(tree->left, inQue);
inQue.Enqueue(tree->info); // “visit”
InOrder(tree->right, inQue);
}
}
 ResetTree and GetNextItem (cont.)

template<class ItemType>
void PostOrder(TreeNode<ItemType>tree,
QueType<ItemType>& postQue)
{
if(tree != NULL) {
PostOrder(tree->left, postQue);
PostOrder(tree->right, postQue);
postQue.Enqueue(tree->info); // “visit”
}
}
 ResetTree
template<class ItemType>
void TreeType<ItemType>::ResetTree(OrderType order)
{
switch(order) {
case PRE_ORDER: PreOrder(root, preQue);
break;
case IN_ORDER: InOrder(root, inQue);
break;
case POST_ORDER: PostOrder(root, postQue);
break;
}
}
 GetNextItem
template<class ItemType>
void TreeType<ItemType>::GetNextItem(ItemType& item, OrderType
order, bool& finished)
{
finished = false;
switch(order) {
case PRE_ORDER: preQue.Dequeue(item);
if(preQue.IsEmpty())
finished = true;
break;
 
case IN_ORDER: inQue.Dequeue(item);
if(inQue.IsEmpty())
finished = true;
break;
 
case POST_ORDER: postQue.Dequeue(item);
if(postQue.IsEmpty())
finished = true;
break;
}
}
Iterative Insertion and Deletion
• Reading Assignment (see textbook)
Comparing Binary Search Trees to Linear Lists
Big-O Comparison
Binary Array- Linked
Operation
Search Tree based List List
Constructor O(1) O(1) O(1)
Destructor O(N) O(1) O(N)
IsFull O(1) O(1) O(1)
IsEmpty O(1) O(1) O(1)
RetrieveItem O(logN)* O(logN) O(N)
InsertItem O(logN)* O(N) O(N)
DeleteItem O(logN)* O(N) O(N)
*assuming h=O(logN)
Exercises 37-41 (p. 539)
Exercise 17 (p. 537)
Exercise 18 (p. 537)