What is a binary tree? (2pts) 2. What is a binary search tree? (2pts) 3. In a binary search tree, how many child nodes a tree node can have? (2pts) 4. Given a binary search tree shown below, the value shown in a tree node indicates the value stored in that node. if one wants to insert a new value 20 in the tree, what is the right place for the new node? (2pts) 10 5. Using the same tree shown above, if one wants to insert a new value 12 in the tree, what is the right place for the new node? (2pts) 6.1. Draw the new binary search tree when value 157 and 325 are inserted into the initial tree. (3pts) 6.2. After question 6.1, draw the new binary search tree when value 101 and 423 are inserted into it. (3pts) 6.3. After question 6.2. draw the new binary search tree when value 211 and 313 are inserted into it. (3pts)