Define a set of axioms for the ADT sorted list and use them to prove that the sorted list of characters, which is defined by the sequence of operations
Create an empty sorted list
Insert S
Insert T
Insert R
Delete T
is exactly the same as the sorted list defined by the sequence
Create an empty sorted list
Insert T
Insert R
Delete T
Insert S
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.