Home
💮 TS-Collection
/
GitHub
/
  • Overview
  • Algorithm
    • Binarysearch
    • Bubblesort
    • Insertionsort
    • Linearsearch
    • Mergesort
    • Naivesearch
    • Quicksort
    • Radixsort
    • Selectionsort
    • Shellsort
  • Data-Structures
    • Binarysearchtree
    • Doublylinkedlist
    • Graph
    • Maxbinaryheap
    • Priorityqueue
    • Queue
    • Singlylinkedlist
    • Stacks
      • #Example
      • #Arguments
  • Examples
    • Search
    • Sort
  • Overview
  • Algorithm
    • Binarysearch
    • Bubblesort
    • Insertionsort
    • Linearsearch
    • Mergesort
    • Naivesearch
    • Quicksort
    • Radixsort
    • Selectionsort
    • Shellsort
  • Data-Structures
    • Binarysearchtree
    • Doublylinkedlist
    • Graph
    • Maxbinaryheap
    • Priorityqueue
    • Queue
    • Singlylinkedlist
    • Stacks
      • #Example
      • #Arguments
  • Examples
    • Search
    • Sort
Edit this page on GitHub
Data-Structures
Stacks

Stacks explanation

Example#

import '@ts-collection/core';

Reference

Arguments#

array#

array: Array<T>

Array is ...

target#

target: T

Target is

Last updated on July 15, 2022
Singlylinkedlist
Search