Use bounded Get And Increment ()methods in tree Node counters to de-vise a Simple Tree algorithm with bounded capacity. Exercise 15.5.In the Simple T re e class, what would happen if add(), after...

Use bounded Get And Increment ()methods in tree Node counters to de-vise a Simple Tree algorithm with bounded capacity. Exercise 15.5.In the Simple T re e class, what would happen if add(), after placing anitem in the appropriate B in, incremented counters in the same top-down manner as in the remove Min ()method? Give a detailed example.