Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with stack
Search options not deleted
user 117820
A stack is a last in, first out (LIFO) abstract data type and data structure. Perhaps the most common use of stacks is to store subroutine arguments and return addresses.
6
votes
1
answer
276
views
Balancing Brackets Algorithm: Stack Data Structure
I am currently refining my understanding of data structures and as such, decided to implement a popular application of the Stack. … function isBalanced(arr){
var stack = new Stack();
var last;
arr.forEach(function(curr){
if (curr === '(' || curr === '[' || curr === '{') {
stack.push(curr);
}
if (curr === ' …
- 183