Write a C++ program to implement a Binary Search Tree (BST) class with the
following functionalities:
1. Insert a node: Implement a function to insert a new node with a given value into the BST while maintaining the BST property. 

2. Search for a value: Implement a function to search for a given value in the BST. The function should return true if the value is found and false otherwise. 

3. Find the minimum and maximum values: Implement functions to find the minimum and maximum values present in the BST. 

4. Inorder Traversal: Implement a function to perform an inorder traversal of the BST and print the elements in ascending order. 

5. Delete a node: Implement a function to delete a node with a given value from the BST while maintaining the BST property. 

6. Display the BST: Implement a function to display the elements of the BST in a graphical form (e.g., using an inorder traversal). 

7. Additional Functionality (Optional): Add any additional functionality to the BST that you find interesting or useful.