You are required to write two seperate programs. Programs will read all information from a text file named “[login to view URL]”. Programs will only read the file, they will not write to the file. There will be no user interface. Binary Search Tree should be built by order of Magnitude, and it is allowed to have identical magnitude values.
Program1: Implement a Binary Search Tree by using Array.
Program2: Implement a Binary Search Tree by using Linked List.
For detail information about this project please check the attached pdf file .
I can do this well. Commented and stuctured code. The assignment made me confused a bit (Program 1: it looks more like a heap; otherwise it need array of size 2^n to store n elements; Program 2: no rule is given). I can explain further, we can work it out.
Hi, I have 15 years of experience in software development. I worked in the elite technological units of the Israeli army and in cutting edge startups.
I assume that when you say "linked list" you mean that the node are connected as as nodes in a linked list would be (but not a "classic" linked list.
Is there another specification?
Ron