1.1. A computer program is being written to store data about students.

Fig. 2 shows a binary search tree that stores data about students.

Each student is represented by their ID number. The current contents of the binary search tree are:

Fig. 2

Identify the root node in the binary tree shown in Fig.2

1.2. Identify two leaf nodes in the binary tree shown in Fig. 2

1.3. Four more students are added to the binary search tree shown in Fig. 2 in this order:

1420 2050 2780 2600

Complete the binary search tree here by adding the new students to it