If we were to insert the node 11 in the following red-black tree with the RB_Insert function (z pointer shows the node to be inserted) the y pointer would show the node 12 10 16 15 RB-INSERT(T. 2) TREE-INSERT (T.z) z.color = RED 1 while 2* T.root and z.p.color == RED 2 if z.p == z.p.p.left 3 y = z.p.p.right 4 if y.color == RED 5 z.p.color = BLACK 6 y.color = BLACK 7 z.p.p.color = RED 8 z = z.p.p 9 else 10 if z == z.p.right 11 z = 2.P 12 LEFT-ROTATE(T. 2) 13 RIGHT-ROTATE(T. z.p.p) else (same as then clause 14 with "right" and "left" exchanged) 15 T.root.color = BLACK Il case 1 Il case 1 // case 1 // case 1 Il case 2 // case 2 // case 3