Computer Science, asked by atulnagpure, 1 month ago

data structures who erase from its beginning and ending

Answers

Answered by tabrezkhan9812
0

Answer:

Answer:Deleting the top element of a stack is O(1), which is valid because you only have access to the top of the stack. Hash tables also have amortized O(1) deletion for any element of the table

Explanation:

DELETE KEY

Similar questions