Welcome! Log In Create A New Profile

Advanced

Assignment 4 Q2

Posted by hschutte2006 
Announcements Last Post
Announcement : Programming Students at UNISA School of Computing 06/19/2019 02:01PM
Announcement SoC Curricula 09/30/2017 01:08PM
Announcement Demarcation or scoping of examinations and assessment 02/13/2017 07:59AM
Announcement School of Computing Short Learning Programmes 11/24/2014 08:37AM
Announcement Unisa contact information 07/28/2011 01:28PM
Assignment 4 Q2
June 23, 2006 11:24AM
For question a), how do you know which node is the root node? Maybe I don't understand the Binary Search Trees well enough, but it looks to me like there could be multiple solutions to this question. Any tips?


PS. The book we are using (Data Structures Using C++) is a really terrible book for studying C++. I hope they change this for the students next year.
Re: Assignment 4 Q2
June 27, 2006 08:52AM
Since it is an empty binary search tree, the first insert item is the root node. Once you start inserting the new items from that point you'll see that there is only one solution.

I find the book much better than last years C++ book.

Good luck!
Sorry, only registered users may post in this forum.

Click here to login