Insert into a binary tree

remember => node.left < node.data < node.right

now, start drawing tree-->

• step 1: take 1st value 74 put it in the root node
• 2 : take 2nd value 64, put it in the left node of root (since 64<74)
• 3 : 3rd value 93 put it in the right node of root (since 93 > 74)

• 4 : 4rth value 69 --> correct place is right node of 64 (tricky part to understand)

• 5 : 68 goes to left node of 69, (we can't put it in the left of 64)

• 6 : 90 to left node of 93

We simply construct the tree using the fact that node.left < node.data < node.right, which gives us an answer of 68.