Algorithms and Data Structures -- 2
$10-30 USD
Paid on delivery
1.1 Objectives
In this project, you are required to implement an abstract data type called MTTree. MTTree ADT is a complete ternary tree in which each node has a key value less than its children and siblings appear in ascending order of their key values. The figures below show some examples of MTTree ADT. You have to make a wise decision regarding the data structure that is representing the MTTree ADT, so you achieve the best complexity possible in terms of time and space.
Project Description
The MTTree ADT provides the following operations:
1. addItem() allows adding a new node into the tree
2. removeItem() allows removing a node from the tree
3. isEmpty() returns true if the tree is empty
4. size() returns the number of items in the tree
5. getHeight() returns the height of the tree
6. getMinItem() returns the minimum item in the tree
7. getMaxItem() returns the maximum item in the tree
8. getMinItemOfLevel() returns the minimum item on the given level
9. getMaxItemOfLevel() returns the maximum item on the given level
10. getLevelSize() returns the number of items on the given level
11. findItem() searches for the given item in the tree
12. display() displays the items available in the tree
13. displayItem() displays the information of a given item
14. displayItemInOrder() displays the items in ascending order
15. displayMirrorReflection() displays the mirror reflection of the tree
Each of the above operations should be documented properly; a sample run that demonstrates the use of the TMTree ADT is a must too. You should describe the parameters and the expected return value of each operation as well as an analysis of the complexity of time and space required for each operation.
1.2.1 Team Size
Maximum of 3 students. Distribute the workload evenly! Operations that don’t require much work are worth less than those require a lot of work!
Project ID: #24968592
About the project
6 freelancers are bidding on average $25 for this job
Hi, i'm a software engineer with a BS degree in computer science,i can do your task , i will do it as fast as i can and achieve it exactly as you need contact me for discussion
Hi. I am expert in Data Structure using C++ language as well as Java. I will do your ternary tree , MTTree ADT assignment for all given requirements and function you have put in description. Contact me. I will do in 2 More
I have a 5 yrs experience as Software developer and can do this work of yours within 2 days dm for more details
Hi, I have read the description and willing to take this project. I have implemented multiple data structures and am hopeful that i can do this.
Hi There, I have gone through your Problem Statement, and I guess I am the right guy to Solve your this. I have a good knowledge of Algorithm, their space and time complexity as well. As I am Google Kickstart and Code More
I am a computer science student. I've implemented multiple trees like binary tree, heap tree, ternary tree etc. This work will be quite easy for me and will definitely love to work on this. Thanks!
