Question: I have a question about how would I remove a child from a node (root)? Since I can't call remove, if I make the child null, will the children of that child move up? Like, would I just initialize it as null?? Or would I point to the child's child?

Answer: 
In a traditional binary search tree, removal of a node can have different consequences depending on how many children the node has:

* A node with no children can simply be removed
* A node with one child can be removed, and the node will be replaced by its only child. This applies regardless of whether the child is a left or right child.
* A node with two children has a slightly more complicated rule: you must find the **in-order successor** or **in-order predecessor** of the node to be removed, replace the current node's value with its sucessor's or predecessor's value, then delete the successor or predecessor (according to these rules).
Is this homework? Nothing wrong with that... we just like to help people learn rather than tell them the answers.

If you just set the child node to null you'll lose any information about the childs children.