Design a class BSTOfIntegers, using nodes with the following methods:

BSTOfIntegers() // default constructor creating an empty tree

BSTOfIntegers(int[] nodes) // parameterized constructor creating a tree using the numbers provided

insert(int e) // inserts a new element into a tree, if the tree already had e, prints an error

delete(int e) // if e exists in the tree, deletes it, otherwise prints an error

search(int e) // returns true if e is in the tree, false otherwise

printPostOrder() // learn how to implement the next three methods on your own. Lecture #6 slides have links to two explainer videos and explanation of how it should work

printInOrder()

printPreOrder()

Please take care of various edge cases. Test all of the methods in the main method: - test both constructors - test how insertion of an integer which already exists in the tree works - test how deletion of an integer which does not exists in the tree works - make sure to add comments for explanation