{"id":6688,"date":"2023-03-02T05:23:54","date_gmt":"2023-03-02T05:23:54","guid":{"rendered":"https:\/\/www.goodacademic.com\/blog\/questions\/2-3-4-tree-code-with-insertion-and-deletion-in-java\/"},"modified":"2023-03-02T09:45:31","modified_gmt":"2023-03-02T09:45:31","slug":"tree-code-with-insertion-and-deletion-in-java","status":"publish","type":"questions","link":"https:\/\/www.goodacademic.com\/blog\/questions\/tree-code-with-insertion-and-deletion-in-java\/","title":{"rendered":"tree code with insertion and deletion in JAVA"},"content":{"rendered":"<p>1. Task<\/p>\n<p>Trace the operation of a 2-3-4 Tree (The instructor\u2019s correct way) given the following operations: <br \/>\ninsert(47)<br \/>\ninsert(43) <br \/>\ninsert(23) <br \/>\ninsert(90) <br \/>\ninsert(95) <br \/>\ninsert(27) <br \/>\ninsert(67) <br \/>\ninsert(80) <br \/>\ninsert(88) <br \/>\ninsert(29) <br \/>\ninsert(59) <br \/>\ninsert(24) <br \/>\ninsert(69) <br \/>\ninsert(44) <br \/>\ninsert(71) <br \/>\ninsert(61) <br \/>\ninsert(99) <br \/>\ninsert(42) <br \/>\ninsert(38)<br \/>\nNext, Delete the following items sequentially. <br \/>\ndelete(27)<br \/>\ndelete(38)<br \/>\ndelete(44) <br \/>\ndelete(95) <br \/>\ndelete(88) <br \/>\ndelete(59)<\/p>\n<p>\nStarting with an empty tree, perform the following insertion operations:<br \/>\ninsert(17) <br \/>\ninsert(15) <br \/>\ninsert(49) <br \/>\ninsert(34) <br \/>\ninsert(76) <br \/>\ninsert(59) <br \/>\ninsert(97) <br \/>\ninsert(69) <br \/>\ninsert(46) <br \/>\ninsert(86) <br \/>\ninsert(20) <br \/>\ninsert(99) <br \/>\ninsert(22) <br \/>\ninsert(52) <br \/>\ninsert(89) <br \/>\ninsert(57)<\/p>\n<p>insert(10)<br \/>\ninsert(41) <br \/>\ninsert(75) <br \/>\ninsert(37)<br \/>\nAnd then do the following deletions:<br \/>\ndelete(99) <br \/>\ndelete(22) <br \/>\ndelete(69) <br \/>\ndelete(15) <br \/>\ndelete(10) <br \/>\ndelete(75)<\/p>\n<p>\n2 Deliverables<br \/>\nJava Program (source code) file, and an output file of a tree with nodes and values.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>1. Task Trace the operation of a 2-3-4 Tree (The instructor\u2019s correct way) given the following operations: insert(47) insert(43) insert(23) insert(90) insert(95) insert(27) insert(67) insert(80) insert(88) insert(29) insert(59) insert(24) insert(69) insert(44) insert(71) insert(61) insert(99) insert(42) insert(38) Next, Delete the following items sequentially. delete(27) delete(38) delete(44) delete(95) delete(88) delete(59) Starting with an empty tree, perform the [&hellip;]<\/p>\n","protected":false},"author":3,"featured_media":0,"comment_status":"open","ping_status":"closed","template":"","meta":[],"disciplines":[211],"paper_types":[],"tagged":[],"aioseo_notices":[],"_links":{"self":[{"href":"https:\/\/www.goodacademic.com\/blog\/wp-json\/wp\/v2\/questions\/6688"}],"collection":[{"href":"https:\/\/www.goodacademic.com\/blog\/wp-json\/wp\/v2\/questions"}],"about":[{"href":"https:\/\/www.goodacademic.com\/blog\/wp-json\/wp\/v2\/types\/questions"}],"author":[{"embeddable":true,"href":"https:\/\/www.goodacademic.com\/blog\/wp-json\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/www.goodacademic.com\/blog\/wp-json\/wp\/v2\/comments?post=6688"}],"version-history":[{"count":1,"href":"https:\/\/www.goodacademic.com\/blog\/wp-json\/wp\/v2\/questions\/6688\/revisions"}],"predecessor-version":[{"id":6739,"href":"https:\/\/www.goodacademic.com\/blog\/wp-json\/wp\/v2\/questions\/6688\/revisions\/6739"}],"wp:attachment":[{"href":"https:\/\/www.goodacademic.com\/blog\/wp-json\/wp\/v2\/media?parent=6688"}],"wp:term":[{"taxonomy":"disciplines","embeddable":true,"href":"https:\/\/www.goodacademic.com\/blog\/wp-json\/wp\/v2\/disciplines?post=6688"},{"taxonomy":"paper_types","embeddable":true,"href":"https:\/\/www.goodacademic.com\/blog\/wp-json\/wp\/v2\/paper_types?post=6688"},{"taxonomy":"tagged","embeddable":true,"href":"https:\/\/www.goodacademic.com\/blog\/wp-json\/wp\/v2\/tagged?post=6688"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}