I am writing a binary taxonomy tree program that reads from an file and reconstruct the tree. The program will learn from the users and expand the tree.
The requirement is each node must contain an 'index' or 'key' value to be used for reconstructing the tree from the input file, using the BINARY SEARCH TREE method of insertion.
The question is how can I use 'index' to determine where the parents and children should go in the tree? If I use number, do I just pick a number randomly and assign to each node? Thanks in advance.