CS 201 - Data Structures and Discrete Mathematics I ...
CS 201 - Data Structures and Discrete Mathematics I – Spring 2005
Homework 3: Tree
General Information
Deadline: 11:59pm, April 25, 2004
The purpose of this homework is to practice Tree and traverse algorithm. You are required to use Java. The homework is not a group project and everybody should work on it individually. We will run your programs with MOSS, which gives us an indication whether two programs are too close to have been written independently.
Problems (2 points)
(1) Write a binary tree class named my_Tree as the basic data structure.
(2) Write a class named my_SortedTree with three methods.
(i) Given a sequence of numbers (total number of numbers will be the full tree size 2n-1), sort them in an increasing order.
(ii) Store the sorted sequence in a full binary tree so that use the “in order” traverse algorithm can print them in an increasing order. Note that your tree MUST be a full tree.
For example, given “14 23 13 18 11 26 16” as input, your program should sort them first, so that the sequence is “11 13 14 16 18 23 26”, then insert those seven numbers into tree structure one by one, it should be
[pic]
(iii) Use the level-order traverse algorithm to print all of them.
In the main method, you should call those three methods one by one to show all of them work well. You can assume that all numbers in sequence are different. You can assume that we will provide enough numbers to fill a full tree.
Sample Run:
Please Enter Numbers:
14 23 13 18 11 26 16
After sorting them, you will get:
11 13 14 16 18 23 26
Tree has been constructed!
Do you want to print them?
y
Level-order traverse:
16 13 23 11 14 18 26
What to turn in
You should turn in two java files, one is named my_Tree.java, and the other is named my_SortedTree.java. You should write main within my_SortedTree.java.
How to turn in
login to oscar.cs.uic.edu, go to your working directory and run turnin.
"turnin -c cs201 -p project3 my_Tree.java my_SortedTree.java "
You may run turnin as many times as you want (only the last copy is saved).
You can use “turnin -c cs201 -p project3 –v” to check whether you have turned in successfully.
For more help, you can type
turnin -h
or
man turnin
Note
1. You MUST make sure that your program can compile using "javac" and run using “java" on oscar.cs.uic.edu.
2. You use an IDE, such as Jbuilder, to code and to debug, but you must make sure that your code can be compiled and run on oscar.cs.uic.edu without any additional packages.
3. Remember to comment your code.
-----------------------
16
23
18
13
11
14
26
................
................
In order to avoid copyright disputes, this page is only a partial summary.
To fulfill the demand for quickly locating and searching documents.
It is intelligent file search solution for home and business.
Related download
- lab manual of java programming mait
- java exercises more
- java tutorialspoint
- learning computer programming using java with 101
- java for beginners
- java class worksheet ms khan s website
- c sci 144 java 1 university of washington
- cis101 practice test pace
- course audit syllabus using building java programs
- cs 201 data structures and discrete mathematics i
Related searches
- american structures and design
- brain structures and their functions
- brain structures and functions worksheet
- discrete mathematics symbols meaning
- discrete mathematics symbols
- subcortical structures and their functions
- us government structures and institutions
- example of continuous and discrete data
- academic essay structures and format
- structures and functions of the brain
- cerebral structures and function
- discrete mathematics answer key