Write a GUI program that animates the 2–4 tree insert, delete, and search methods, as shown in Figure 42.4.

Transcribed Image Text:

Tree m 0 Tree24 The root of the tree. The size of the tree. - root: Tree24Node +size: int +Tree24 () +Tree24 (objects: E[]) +search (e: E): boolean +insert (e: E): boolean +delete(e: E): boolean Creates a default 2-4 tree. Creates a 2-4 tree from an array of objects. Returns true if the element is in the tree. Returns true if the element is added successfully. Returns true if the element is removed from the tree successfully. Returns true if element e is in the specified node. - matched (e: E, node: TreeNode): boolean -getChildNode (e: E, node: TreeNode ): Tree24Node Returns the next child node to search for e. -insert23 (e: E, rightChildofe: Tree24Node, node: Tree24Node): void - split(e: E, rightChildofe: Tree24Node, u: Tree24Node, v: Tree24Node): E Inserts element along with the reference to its right child to a 2- or 3-node. Splits a 4-node u into u and v, inserts e to u or v, and returns the median element. -locate(e: E, node: Tree24Node): int Locates the insertion point of the element in the node. - delete(e: E, node: Tree24Node): void - validate(e: E, u: Tree24Node, path: ArrayList>): void - path(e: E): ArrayList Deletes the specified element from the node. Performs a transfer and fusion operation if node u is empty. Returns a search path that leads to element e. Tree24Node el ements: ArrayList child: ArrayList> An array list for storing the elements. An array list for storing the links to the child nodes. +Tree24 () +Tree24 (o: E) Creates an empty tree node. Creates a tree node with an initial element. Link