Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Analysis of Algorithms Max Alekseyev
 

Summary: 1/20
Analysis of Algorithms
Lecture 15
Max Alekseyev
University of South Carolina
October 28, 2010
2/20
Outline
Binary Search Trees
Inorder Tree Walk
Searching
Minimum and Maximum
Successor and Predecessor
Insertion
Deletion
3/20
Search Trees
Data structures that support many dynamic-set operations.
Can be used as both a dictionary and as a priority queue.
Basic operations take time proportional to the height of the

  

Source: Alekseyev, Max - Department of Computer Science and Engineering, University of South Carolina

 

Collections: Biotechnology; Computer Technologies and Information Sciences