代写CHC5223、代做Java设计编程

日期：2023-08-22 10:26

CHC5223 Data Structures and Algorithms Resit 2022–2023 Semester 2

1 of 3

Assignment

Value 100% of Coursework Resit

Individual work

Learning outcomes

Students will be able to understand

1.1 Data structures

1.2 The applications of data structures

1.3 Object-oriented programming concepts

1.4 Methods for program testing

Students will have acquired skills in:

2.1 Data abstraction

2.2 The use of data structures

2.3 Programming at a more advanced level in a high-level object-oriented language

2.4 Program testing and documentation

Students will have acquired skills in:

3.1 Self-management

3.2 Learning

3.3 Communication

3.4 Problem solving

3.5 Information technology

Process and what submit to Student Website

The assignment submitted should be compressed into a .zip file, the following files should be

contained in the compressed file：

• a report as a Microsoft Word document containing descriptions and explanations of the

encoding works

filename format: 12345678_CHC5223_CW_Resit_Report.docx

• a .zip file containing the project: all the program’s sourcefiles (.java), including those

provided

filename format: 12345678_CHC5223_ CW_Resit_Files.zip

Introduction

The topic of this assignment is Tree.

This assignment requires you to implement one Java program independently.

Requirements

Task 1

You must create a Java class Node that represents a node that can store an integer number in a

binary tree.

5 marks

You must create a setNumber method that can set the integer number into one Node object.

5 marks

CHC5223 Data Structures and Algorithms Resit 2022–2023 Semester 2

2 of 3

You must create a getNumber method that can return the integer number stored in the Node

object.

5 marks

Explain the encoding work in the report explicitly.

5 marks

Task 2

You must create a Java class called BSTNode that represents a binary search tree that contains

Node objects as nodes of the tree.

The constructor for BSTNode must print the string “Binary Search Tree” to System.out.

5 marks

Explain the encoding work in the report explicitly.

5 marks

Task 3

You must create an addNode method that can put one Node object into a binary search tree in

the class BSTNode.

10 marks

You must create a removeNode method that can remove one existing Node object from a binary

search tree in the class BSTNode, if the node you want to remove does not exist in the tree, the

method should print out one caution message as “no such node in the tree”.

10 marks

Explain the encoding work in the report explicitly.

10 marks

Task 4

You must create an iterative method preOrderIterative that prints all integer numbers stored in

the nodes of a binary search tree via pre-order traversal.

Following is the algorithm:

1. Create a stack and push the root to the stack.

2. Do the following steps while the stack is not empty

a) Peek the stack and print it

b) Pop an item from the stack

c) Push right child of the popped item to the stack

d) Push left child of the popped item to the stack

10 marks

Explain the encoding work in the report explicitly.

10 marks

CHC5223 Data Structures and Algorithms Resit 2022–2023 Semester 2

3 of 3

Task 5

You must create a main program to verify the classes and all methods you created. You can use

the following integer numbers as data stored in Node objects to form a binary search tree. The

sequence of the following numbers should be the sequence in which the nodes of the tree are

added.

70 31 93 14 73 94 7 23 67 99 25 43 56 88 77 95

10 marks

Explain the encoding work in the report explicitly.

10 marks