the code that handles case deletion can be given as followsvoid del_case (struct node *nstruct node *ss sibling( )if ( -colour =redif ( = -parent -leftrotate_left( -parent)else rotate_right( -parent) -parent -colour reds -colour blackdel_case ( )case psand ' children are black in this casesimply repaint with red in the resultant treeall the paths passing through will have one less black node thereforeall the paths that pass through now have one fewer black nodes than the paths that do not pass through pso property is still violated to fix this problemwe perform the rebalancing procedure on pstarting at case case is illustrated in fig sr sl sr sl figure insertion in case the code for case can be given as followsvoid del_case (struct node *nstruct node *ss sibling( )if (( -parent -colour =black&( -colour =black&( -left -colour =black&( -right -colour =black) -colour reddel_case ( -parent)else del_case ( )case and ' children are blackbut is red in this casewe interchange the colours of and although this will not affect the number of black nodes on the paths going through sit will add one black node to the paths going through nmaking up for the deleted black node on those paths figure illustrates this case