Computer Science(Java): Do not use Queque,stack... For initial sequence values, accept them as string and then parse to Integer

Instructions: Your program should read from the standard input a sequence of integer values, with each value separated by a space. Your task is to Build a binary search tree using the values in the order they are entered Print 3 traversals: pre-order, in-order, and post-order. Allow the user to insertidelete a value. Once a new tree is generated, print it in-order. Find predecessor of a given value. The predecessor is the node that appears right before the given value in an in-order traversal. Find successor of a given value. The successor is the node that appears right after the given value in an in-order traversal