Build and Search an Index Tree Using Recursion

Data Structures

A binary search tree is a data structure that is used to handle simple decisions. In this assignment you will use a binary search tree to store words and keep a counter of how many times those words exist in the specified document. The objectives of this assignment are to (1) gain experience researching for a solution to a problem, (2) design and implement a binary search tree (BST) class, as well as the methods to add to and search in a BST, (3) Design and implement a recursive solution for traversing the BST, and (4) improve written skills through the implementation of proper coding styles and documentation.

This assignment is typically given later in the semester, as students should understand classes and objects, I/O, and recursion.

Bill Eberle

design document, code, comments, pseudo-code, test results, documentation, reflection, tech report

Two Weeks

reading, writing, listening

implementation, tools. design, recursion, trees, problem solving, searching, sorting

RESEARCH
Technical Task: In order to learn technical material, one must be able to decipher key concepts through reading.
Professional Setting: Student works for a software company.
Professional Role: Student works along on a task for a project.
Deliverable: Design decisions discussed in design document.
Real-world Audience: Team Lead.
How the Audience will USE the students' communication: The Team Lead will use the student's design decision(s) to determine the feasibility of their proposed solution.
Additional Notes: Of course, the reading of technical material is not like reading a novel, and one must be able to transfer the pertinent information to a useful form. The two methods of communicating design to others are: speaking and writing. In order for others to digest your intentions, one must learn to effectively write their ideas so that it can be interpreted at the reader’s discretion – either due to remoteness or time.

N/A