BST Node Search and Delete

Problem Given the root of a Binary Search Tree and an integer, implement operations that first locate the node containing that value and then remove a specified node. You must also create the tree class and write your own tests. Tree Node Definition Use the following node structure: Required Functions Implement these functions with the provided signatures: Input Each operation receives the root of a BST and an integer value used for searching or deletion. Output searchBST…