Question

1. Implement a class BinarySearchTree that generates binary-search tree objects. The class must contain the following methods: Instance Methods • Constructors: (i) BinarySearchTree() - default constructor initializes an empty max-heap. (ii) BinarySearchTree(Array[] data) - overloaded constructor builds a binary search tree using the array data • Setters: (i) insert(Object e) - adds an object e to the tree into a position that maintains the binary search tree property. (ii) delete(Object e) - returns and removes the object e if it is found in the tree. Otherwise, throws an error/exception. • Getters: (i) find(Object e) - returns the Node where e is found, if it is found in the tree. Otherwise, it returns null. (ii) findMin() - returns the Node with the least value. (iii) findMax() - returns the Node with the largest value. (iv) printInorder() - prints the contents of the binary search tree in increasing order. (v) printPreorder() - prints the contents of the binary search tree in pre-order traversal (parent node, then children). (vi) printPostorder() - prints the contents of the binary search tree in post-order traversal (children, then parent).

          1. Implement a class BinarySearchTree that generates binary-search tree objects. The class must contain the following
methods:
Instance Methods
• Constructors:
(i) BinarySearchTree() - default constructor initializes an empty max-heap.
(ii) BinarySearchTree(Array[] data) - overloaded constructor builds a binary search tree using the array
data
• Setters:
(i) insert(Object e) - adds an object e to the tree into a position that maintains the binary search tree
property.
(ii) delete(Object e) - returns and removes the object e if it is found in the tree. Otherwise, throws an
error/exception.
• Getters:
(i) find(Object e) - returns the Node where e is found, if it is found in the tree. Otherwise, it returns null.
(ii) findMin() - returns the Node with the least value.
(iii) findMax() - returns the Node with the largest value.
(iv) printInorder() - prints the contents of the binary search tree in increasing order.
(v) printPreorder() - prints the contents of the binary search tree in pre-order traversal (parent node, then
children).
(vi) printPostorder() - prints the contents of the binary search tree in post-order traversal (children, then
parent).

1. Implement a class BinarySearchTree that generates binary-search tree objects. The class must contain the following
methods:
Instance Methods
• Constructors:
(i) BinarySearchTree() - default constructor initializes an empty max-heap.
(ii) BinarySearchTree(Array[] data) - overloaded constructor builds a binary search tree using the array
data
• Setters:
(i) insert(Object e) - adds an object e to the tree into a position that maintains the binary search tree
property.
(ii) delete(Object e) - returns and removes the object e if it is found in the tree. Otherwise, throws an
error/exception.
• Getters:
(i) find(Object e) - returns the Node where e is found, if it is found in the tree. Otherwise, it returns null.
(ii) findMin() - returns the Node with the least value.
(iii) findMax() - returns the Node with the largest value.
(iv) printInorder() - prints the contents of the binary search tree in increasing order.
(v) printPreorder() - prints the contents of the binary search tree in pre-order traversal (parent node, then
children).
(vi) printPostorder() - prints the contents of the binary search tree in post-order traversal (children, then
parent).

Added by Patrick R.

Question

Please give Ace some feedback