Lecture 1 - Tries

Question 1

Are binary search trees comparison based?

Answer 1

Yes, as at each node you have to pick a branch based on the size of the target.

Question 2

What are tries?

Answer 2

Trees with each node having a key value that is added to the sequence collected when traversing the structure, so at each node there is a mutliway decision to be made.

Question 3

What are tries especially useful for?

Answer 3

Storing trees.

Question 4

Tries complexity?

Answer 4

The complexity is almost independent of number of items, it is essentially linear.

Question 5

How can we implement tries?

Answer 5

Using LLs or arrays. There is a space-time tradeoff between the two.