A database contains 1,000,000 records which can be sorted into ascending order by an ID number. We are searching for the record whose ID number is X. Suppose it takes 1 microsecond to compare one record with X. There are two implementations of the database: one uses a linear list, and one uses a binary search tree. Which statement is true?

Question

Accepted Answer

The linear list search takes an average of about 500,000 microseconds. 
 
The binary search tree takes an average about 20 microseconds.

Answer

The linear list search takes an average of about 1,000,000 microseconds. 
 
The binary search tree takes an average of about 500,000 microseconds

Answer

Both versions (the linear list and the binary search tree) 
 
take roughly the same time.

Crowdly

A database contains 1,000,000 records which can be sorted into ascending order b...

Want instant access to all verified answers on moodle.gla.ac.uk?