SECTION C(JAVA)Look at the class definitions below and answer the questions based on it:class Node{// attributesint ID;String name; Node left; // left child Node right; // right child}class BinarySearchTree{// attributesNode root;// methodssearch(int key, Node root);void insert(int key, Node root);void delete(int key, Node root);}Write code for a method split(int key, Node root) that divides a binary searchtree into two parts. The split should occur at key and create two new binary searchtrees. Return the root of each resulting tree.Test your code with the input in the worked exampleBELOW IS THE INPUT:// id, name41, notes11, personal61, work30, shopping5, recipes55, proposal70, thesis10, muffins43, draft
SECTION C(JAVA)Look at the class definitions below and answer the questions based on it:
class Node
{
// attributes
int ID;
String name;
Node left; // left child
Node right; // right child
}
class BinarySearchTree
{
// attributes
Node root;
// methods
search(int key, Node root);
void insert(int key, Node root);
void delete(int key, Node root);
}
Write code for a method split(int key, Node root) that divides a binary search
tree into two parts. The split should occur at key and create two new binary search
trees. Return the root of each resulting tree.
Test your code with the input in the worked example
BELOW IS THE INPUT:
// id, name
41, notes
11, personal
61, work
30, shopping
5, recipes
55, proposal
70, thesis
10, muffins
43, draft
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
