please help

Question

Your task is to design a program based on binary search trees which is divided into two phases:
1. Create, edit, delete and find an account based on account number.
2. The bank asked you to improve your program to allow each client to have more than one account. Perform the previous tasks considering these new specifications.

Answer 1

YOUR TASK

If you have a doubt, or if we can explain something to you, you can ask
If you want us to make your complete homework, don't

You won't learn if you don't investigate, READ, PRACTICE

Answer 2

Depends on how the accounts are stored. I presume you have classes like BankAccount and Client.
In the second part consider thinking about your problem :
- you have a number, get the corresponding account.

Everything else is irrelevant. Now, how would be efficient to store the accounts so that you can easily parse through them?

Answer 3

@Dago I'm just stuck on the more than one account part

Answer 4

i think i need to put singly linked list in the node of the BST but when i did the program is adding every new account to the same list and not making a new node in the BST can u help me with that @Norbivar