The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
5 views
Implement a stack using a singly linked list $L$. The operations $PUSH$ and $POP$ should still take $O(1)$ time.
in Algorithms by Boss (41.1k points) | 5 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
49,829 questions
54,735 answers
189,349 comments
80,095 users