1. 188, 1 128 2 18 2, 18 125 2 8 5, 91 1891 8 125 2 8 32 911832 8 125 2 8 27 9132 27 8 32 1827 Adding values Insertion grading Subtract 5 points for each incorrect step Subtract 1 point for each missing connecting pointer on the leaves If only key value incorrect – subtract 5

2. 125 2 6 6, 80 8032 27 8 32 1827 6 891 125 2 6 10 8032 18 8 27 6 891 27 32 1018 125 2 6 39 32 18 8 27 6 880 27 32 101891 80 Adding values

3. 125 2 6 27 3932 10 8 6 880 18 32 101891 80 Removing values 125 2 6 3932 10 8 5 880 18 32 101891 80 12 2 5 3932 10 8 880 18 32 101891 80

4. 12 2 10 3932 18 8 880 32 1891 80 Removing values Deletion grading Subtract 5 points for each incorrect step If only key value incorrect – subtract 2