I was given the following assignment, which I don't fully understand:
Write a program to implement a “Decimal Search Tree”, a popular tool used for searching in Libraries, police stations, Traffic control, …..
A Decimal search tree is a tree where each node has 10 children, one for each digit. The tree is built from the file of random 3-digit numbers generated from the first program. Obviously, the depth of the tree would be 4 levels. Then provide the following capabilities for the user:
List all numbers in the tree
Search for a certain number in the tree
Search for all numbers beginning with certain digits( e.g. “45*”)
Add a certain new number
Delete a certain number
Can anybody explain to me what this means? I know what a binary search tree is, but can't understand what is meant here.