Implementing Stacks & Queues

Why might you choose this object-based Stack implementation over an array-based one?

class Stack {
  constructor() {
    this.size = 0;
    this.storage = {};
  }
  
  push(element) {
    this.storage[this.size] = element;
    this.size++;
  }
  
  pop() {
    if (this.size === 0) return undefined;
    this.size--;
    const result = this.storage[this.size];
    delete this.storage[this.size];
    return result;
  }
}

Better readability
Faster operations
Memory efficiency
Object-based implementation provides memory benefits: 1) No unused array indices, 2) Direct control over memory allocation, 3) Efficient property deletion, 4) No array length maintenance overhead, 5) Better for sparse data structures, 6) More predictable memory usage, 7) Easier garbage collection, 8) Suitable for memory-constrained environments.
Built-in features

Next Question (19/20)