Add additional functions to your Binary Tree project.

search: This method should return True if the tree contains a node with the specified value, and False otherwise. It can be implemented using a similar approach as the add$\_$node method, but instead of adding a node, it checks if the current node data is equal to the value being searched for. If not, it continues to traverse the tree until the value is found or there are no more nodes to traverse.

find$\_$min: This method should return the node with the minimum value in the tree. It can be implemented by starting at the root node and following the left children until there are no more left children.

find$\_$max: This method should return the node with the maximum value in the tree. It can be implemented by starting at the root node and following the right children until there are no more right children.

delete: This method should delete a node from the tree with the specified value. It can be implemented by first finding the node to delete, and then removing it while still maintaining the binary search tree property.

height: This method should return the height of the tree, which is the length of the longest path from the root to a leaf node. It can be implemented by recursively computing the height of the left and right children, and returning the maximum of the two heights plus one.