figure (bfigure ( is an internal node to delete this value swap with its in-order successor so that now becomes leaf node remove the value from the leaf node now there is leaf node that has less than data value thereby violating the property of - tree so the node must be merged to merge the nodepull down the lowest data value in the parent' node and merge it with its left sibling figure ( figure ( is present in leaf nodeso the data value can now there is leaf node that has less than data valuethereby violating the property of - tree be easily removed so the node must be merged to merge the nodepull down the lowest data value in the parent' node and merge it with its left sibling figure (ffigure ( is an internal node to delete this value swap with its in-order successor so that now becomes leaf node remove the value from the leaf node now there is leaf node that has less than data valuethereby violating the property of - tree so the node must be merged to merge the nodepull down the lowest data value in the parent' node and merge it with its left sibling figure (han internal node cannot be emptyso now pull down the lowest data value from the parent' node and merge the empty node with its left sibling figure (ideleting values from the given - tree