Try this exercise. Fill in the missing part by typing it in.

To insert a new node into a binary tree, we follow these steps: 1. If the tree is empty, create a new node and set it as the root. 2. If the tree is not empty, start from the root and compare the value to be inserted with the current node's value. 3. If the value is less than the current node's value, move to the left subtree and repeat step 2. 4. If the value is greater than the current node's value, move to the right subtree and repeat step 2. 5. If both subtrees are empty, create a new node and insert it as either the left or right child of the current node based on the comparison.

To insert the value 8 into the binary tree shown below, we would follow these steps:

1      10
2     /  \
3    5    15
4   / \   /
5  3   7  12
6        / \
7      11   13

Step 1: Start from the root (10) and compare 8 with 10. Step 2: Since 8 is less than 10, move to the left subtree. Step 3: Compare 8 with 5. Step 4: Since 8 is greater than 5, move to the right subtree. Step 5: Compare 8 with 7. Step 6: Since 8 is greater than 7 and the right subtree is empty, insert 8 as the right child of 7.

Conclusion: The value 8 would be inserted as the right child of the node with the value 7.

Fill in the blank: The value 8 would be inserted as the ___ child of the node with the value 7.