Please assist me in solving this: /////////////////////////////////////////////////////////////////////////// // // Pro3110 // // Write a program that creates a binary search tree of 8 or more // (25 max) random candy bar names from a datum list. // // Krackel // ..................../ \........... // / \ // Godiva Mounds // ...../ \..... ...../ \..... // / \ / \ // Almond Joy Heath Bar Milky Way Mr. Goodbar // \..... // \ // Kit Kat // // Define the ancestors operation by writing the method that will // search for a target node and return the set of nodes that connect // the target node with the root. The set contains the root but // does not contain the target. This set of nodes are the ancestor // nodes of the target. If the root is the target node, retun an // empty set. If the target cannot be found in the tree, return // null. // // eg. // String data = "Milky Way"; // ancestors( data ); // // (Mounds, Krackel) // // eg. // String data = "Krackel"; // ancestors( data ); // // () // // eg. // String data = "Twix"; // ancestors( data ); // // null // // /////////////////////////////////////////////////////////////////////////// package problem_set_31; /* String[] datum = {"100 Grand","5th Ave","Aero","Almond Joy", "Baby Ruth","Boost","Bounty","Butterfinger","Caramello","Caramilk", "Dairy Milk","Coffee Crisp","Dove","Galaxy","Godiva","Heath Bar", "Kisses","Krackel","Kit Kat","Marathon","Mars","Milk Duds", "Milky Way","Mounds","Mr. Goodbar","Crunch","Goobers","PayDay", "Peanut Butter Cups","Skor","Snickers","Toblerone","Twix", "Whoppers'","ZERO"}; */ Please code in 2 buttons, button 1 to create the tree and, button 2 to find the acensetors of the inputted candy bar.
Please assist me in solving this:
///////////////////////////////////////////////////////////////////////////
//
// Pro3110
//
// Write a program that creates a binary search tree of 8 or more
// (25 max) random candy bar names from a datum list.
//
// Krackel
// ..................../ \...........
// / \
// Godiva Mounds
// ...../ \..... ...../ \.....
// / \ / \
// Almond Joy Heath Bar Milky Way Mr. Goodbar
// \.....
// \
// Kit Kat
//
// Define the ancestors operation by writing the method that will
// search for a target node and return the set of nodes that connect
// the target node with the root. The set contains the root but
// does not contain the target. This set of nodes are the ancestor
// nodes of the target. If the root is the target node, retun an
// empty set. If the target cannot be found in the tree, return
// null.
//
// eg.
// String data = "Milky Way";
// ancestors( data );
//
// (Mounds, Krackel)
//
// eg.
// String data = "Krackel";
// ancestors( data );
//
// ()
//
// eg.
// String data = "Twix";
// ancestors( data );
//
// null
//
//
///////////////////////////////////////////////////////////////////////////
package problem_set_31;
/* String[] datum = {"100 Grand","5th Ave","Aero","Almond Joy",
"Baby Ruth","Boost","Bounty","Butterfinger","Caramello","Caramilk",
"Dairy Milk","Coffee Crisp","Dove","Galaxy","Godiva","Heath Bar",
"Kisses","Krackel","Kit Kat","Marathon","Mars","Milk Duds",
"Milky Way","Mounds","Mr. Goodbar","Crunch","Goobers","PayDay",
"Peanut Butter Cups","Skor","Snickers","Toblerone","Twix",
"Whoppers'","ZERO"};
*/
Please code in 2 buttons, button 1 to create the tree and, button 2 to find the acensetors of the inputted candy bar.
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images
