Okay, this is my problem. I want to write a not so simple database using linked lists and a binary tree, but the data that I'm using consists of three categories.
It's a database for a movie rental store, it stores info for the customers, the employees and the inventory. There are also supposed to be three locations each with customers, employees and an inventory.
As I understand it, a binary tree can't have more than two children per node. This makes it rather difficult in designing a program that requires three children per node. Does anyone have any idea as to how I can start this program?
