CSC508: Define your own Binary Search Tree (BST) data structure using Linked List: Data Structure Assignment, UiTM, Malaysia

QUESTION

1. Define your own Binary Search Tree (BST) data structure using Linked List You can name your BST as MyBST.

2. Define methods in the BST to perform the following operations :
a. Determine whether the BST is empty
b. Insert an item in the BST.
c. Traverse the BST (preorder, inorder, postorder)
d. Calculate the height of the BST
e. Calculate the number of nodes in the BST
f. Calculate the number of leaves in the BST
g. Calculate the minimum/maximum value in the BST
h. Calculate the total/average value in the BST

3. Write the application class which contains main() to declare object but from class MyBST.

4. Ask the user to enter at least 20 numbers into the BST.
5. Call the following methods (c – h) from main() and display the results accordingly.

The post CSC508: Define your own Binary Search Tree (BST) data structure using Linked List: Data Structure Assignment, UiTM, Malaysia appeared first on Malaysia Assignment Help.