If key Ki is deleted from a leaf of a bit-tree, then the D-bit between Ki-1 and Ki+1 has t...

If key Ki is deleted from a leaf of a bit-tree, then the D-bit between Ki-1 and Ki+1 has to be modified. What is the value of this D-bit if the values Di and Di+1 are known? Make deletions in the leaf in Figure 1 to make an educated guess and then generalize this observation. In making a generalization, consider two cases: (a) Di ,<Di+1 and (b) Di<Di+1.

Figure A leaf of a bit-tree.