Could someone please help me by telling me which answer is the correct one for 5,6,7 and8?

To insert a node into a binary search tree, start by searching for the node value. When you reach a leaf node, add the new node as a left child if its value is smaller than the leafs or otherwise add it as a right child. True False Inserting a node into a binary search tree is complicated when inserting after a node that already has two children. True False To find the max value in a binary search tree, start at the root node and keep going right until there are no more right children. True False When removing a node, you must deal with the cases based on whether the node is a leaf or not. whether the node is a left or right child. how many children the node has. what level in the tree the node is