Question: I need help writing this in Java language. This step needs to be a binary tree. Your class should have the following functionality: insert insert
Your class should have the following functionality: insert insert a node into the proper location of the tree remove Remove a specific node from the tree contains Report is the tree contains a specific piece of data findMin Find and return the smallest value in the tree findMax Find and return the largest value in the tree isEmpty Determine if the tree is empty printTree visit each node in the tree and print the data to the screen
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
