Question

Create a BST function that can create a BST (Binary Search Tree). Input 20 positive integers from the user and store them in an array. The BST function must return the pre-order, in-order, and post-order of the created BST. Display a menu with the following options: 1. Delete a number. 2. Change a number. 3. Exit from the program. The user is allowed to delete or overwrite any value in the array by using index numbers. If the user selects option 'a' or option 'b', the BST function must update accordingly and again display all nodes with in-order, pre-order, and post-order. Hint: You can delete a number with any negative value that can be used with a condition to not consider it as a node. Note: This is a single question. Paste the screenshot and source code.

          Create a BST function that can create a BST (Binary Search Tree).
Input 20 positive integers from the user and store them in an array.
The BST function must return the pre-order, in-order, and post-order of the created BST.
Display a menu with the following options:
1. Delete a number.
2. Change a number.
3. Exit from the program.
The user is allowed to delete or overwrite any value in the array by using index numbers.
If the user selects option 'a' or option 'b', the BST function must update accordingly and again display all nodes with in-order, pre-order, and post-order.
Hint:
You can delete a number with any negative value that can be used with a condition to not consider it as a node.
Note: This is a single question. Paste the screenshot and source code.

Added by Matthew H.

Question

Please give Ace some feedback