{"id":349,"date":"2015-04-01T02:19:36","date_gmt":"2015-03-31T15:19:36","guid":{"rendered":"http:\/\/casestudyhelp.com\/sample-questions\/?p=349"},"modified":"2018-01-30T16:28:29","modified_gmt":"2018-01-30T05:28:29","slug":"data-structures-assignment-help","status":"publish","type":"post","link":"https:\/\/casestudyhelp.com\/sample-questions\/data-structures-assignment-help\/","title":{"rendered":"Data Structures Assignment Help"},"content":{"rendered":"
COSC 2007 \u00a0Data Structures II<\/div>\n
\n
2-3 Search Tree<\/div>\n
\n
2-3 trees are data structures commonly used to implement ordered lists of records(or\u00a0tables). A 2-3 tree is a tree satisfying the following requirements\uf0b7<\/div>\n
All internal nodes in the tree have either two or three children.<\/div>\n
\uf0b7<\/div>\n
All leaves of the tree are at the same level.The\u00a02-3 tree\u00a0is also a search tree like the binary search tree, but this tree tries to solve the\u00a0problem of the\u00a0unbalanced tree\u00a0The following link is useful\u00a0to understand how 2-3 trees works:<\/div>\n
\n
Java applet illustrating 2-3 trees.<\/div>\n
Practice adding nodes to the tree and see how the structure of the tree changes<\/div>\n
\n
For this assignment, you should write a Java\u00a0program that read numbers from a file(TwoThreeInsert.txt)\u00a0and store them in a 2-3 tree. The file name MUST be given as an\u00a0argument for the program.\u00a0Then your program should provide a menu to allow the user to\u00a0do the following:<\/div>\n
\n
1.insert a new number to the tree.<\/div>\n
2.print the tree in an ascending order.<\/div>\n
3.print the tree in a descending order.<\/div>\n
4.save the current tree to the file and exit.<\/div>\n
\n
Your program should handle all\u00a0cases, such as adding a number which already exists in\u00a0the tree<\/div>\n
Sample run example:<\/div>\n
\n
$><\/div>\n
java<\/div>\n
MyTree TwoThreeInsert.txt<\/div>\n
Loading the file and insert into a 2<\/div>\n
–<\/div>\n
3 tree<\/div>\n
1. insert 2. print ascending 3. print descending 4. save and exit<\/div>\n
Enter your choice:1<\/div>\n
En<\/div>\n
ter a number:23<\/div>\n
Number inserted.<\/div>\n
1. insert 2. print ascending 3. print descending 4. save and exit<\/div>\n
Enter your choice:1<\/div>\n
Enter a number:23<\/div>\n
Number already exist.<\/div>\n
1. insert 2. print ascending 3. print descending 4. save and exit<\/div>\n
Enter your choice:2<\/div>\n
2 3 5 7 9 1<\/div>\n
2 23 65 67<\/div>\n
1. insert 2. print ascending 3. print descending 4. save and exit<\/div>\n
Enter your choice:5<\/div>\n
67 65 23 12 9 7 5 3 2<\/div>\n
1. insert 2. print ascending 3. print descending 4. save and exit<\/div>\n
Enter your choice:5<\/div>\n
\n
File saved. exiting…<\/div>\n
$><\/div>\n
\n
Bonus (<\/div>\n
1<\/div>\n
marks<\/div>\n
):<\/div>\n
implem<\/div>\n
ent a delete<\/div>\n
method<\/div>\n
that allows the user to delete a node from<\/div>\n
the tree.<\/div>\n
To delete a node from a 2<\/div>\n
–<\/div>\n
3 tree is performed analogously. First the node is located and<\/div>\n
removed. Call<\/div>\n
p<\/div>\n
the parent of the removed node. If the number of children of<\/div>\n
p<\/div>\n
has<\/div>\n
decreased<\/div>\n
from three to two, the tree is still 2<\/div>\n
–<\/div>\n
3. If the number of children of<\/div>\n
p<\/div>\n
has<\/div>\n
decreased from two to one, merge<\/div>\n
p<\/div>\n
with one of its siblings, possibly reducing the<\/div>\n
number of children of<\/div>\n
p<\/div>\n
‘s parent. Precede<\/div>\n
recursively<\/div>\n
, up to the root of the tree. If at the<\/div>\n
end<\/div>\n
deleting a root makes its child become root. For more details how delete should work<\/div>\n
look at the above java applet link<\/div>\n
and the text<\/div>\n
–<\/div>\n
book<\/div>\n
\n
\n
File saved. exiting…<\/div>\n
$><\/div>\n
Bonus (<\/div>\n
1<\/div>\n
marks<\/div>\n
):<\/div>\n
implem<\/div>\n
ent a delete<\/div>\n
method<\/div>\n
that allows the user to delete a node from<\/div>\n
the tree.<\/div>\n
To delete a node from a 2<\/div>\n
–<\/div>\n
3 tree is performed analogously. First the node is located and<\/div>\n
removed. Call<\/div>\n
p<\/div>\n
the parent of the removed node. If the number of children of<\/div>\n
p<\/div>\n
has<\/div>\n
decreased<\/div>\n
from three to two, the tree is still 2<\/div>\n
–<\/div>\n
3. If the number of children of<\/div>\n
p<\/div>\n
has<\/div>\n
decreased from two to one, merge<\/div>\n
p<\/div>\n
with one of its siblings, possibly reducing the<\/div>\n
number of children of<\/div>\n
p<\/div>\n
‘s parent. Precede<\/div>\n
recursively<\/div>\n
, up to the root of the tree. If at the<\/div>\n
end<\/div>\n
deleting a root makes its child become root. For more details how delete should work<\/div>\n
look at the above java applet link<\/div>\n
and the text<\/div>\n
–<\/div>\n
book<\/div>\n
.<\/div>\n
Submission<\/div>\n
:<\/div>\n
\uf0b7<\/div>\n
Hand in your complete Java source code; and a copy of the results<\/div>\n
after running<\/div>\n
your program<\/div>\n
(<\/div>\n
with the given file<\/div>\n
Two Three Insert<\/div>\n
.txt)<\/div>\n
\uf0b7<\/div>\n
Upload your source code to<\/div>\n
CMS<\/div>\n
\uf0b7<\/div>\n
Demonstrate your program to TA before\/on the due date<\/div>\n
<\/div>\n
\n

To get answer chat with online assignment adviser<\/strong><\/p>\n

\"Hire<\/a><\/p>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n