{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Prog4 - Programming Assignment#4 CS163 Data Structures Goal...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Programming Assignment #4 CS163: Data Structures Goal: In this program, our primary goal is to implement a non-linear data structure using a binary search tree. In your design write-up, discuss the performance advantages of this data structure in comparison to those you have used so far this term. Monitor how balanced your tree is, prior to destroying the tree to determine how much better it is than a linear linked list! Problem Statement: You are still considering going into the on-line publishing business, but you have decided that what you really need is a way for people to quickly search for information about the articles you are “publishing”. You have a wide variety of articles – with each article’s title, author’s names (Some articles have 1 author, others have 2 or 3 authors), and a list of keywords that are specific for that articles (e.g., an article author, others have 2 or 3 authors), and a list of keywords that are specific for that articles (e....
View Full Document

{[ snackBarMessage ]}

Page1 / 2

Prog4 - Programming Assignment#4 CS163 Data Structures Goal...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon bookmark
Ask a homework question - tutors are online