Data Structures and ADTs

Question 3

Suppose we have the following set of key values: 

      Able, Baker, Charlie, Delta, Echo
A binary search tree is created from an empty tree by insertion of each of these keys in a certain order. Which of the following is true?

Previous Home Next