Build your intuition. Fill in the missing part by typing it in.

To insert a value into a binary search tree, we compare the value with the current node. If the value is less than the current node, we go _; if it is greater, we go _. We continue this process until we reach a null node, and then we create a new node with the value at that position.