Skip to content

Latest commit

 

History

History
391 lines (277 loc) · 8.43 KB

datastructures.md

File metadata and controls

391 lines (277 loc) · 8.43 KB
Raw

DATA STRUCTURES

Indexer for Data Structures Lover

:octocat: ARRAYS

1 DIMENSIONAL

  • blog/docs
  • implementation
  • implementation using heaps

2 DIMENSIONAL

  • blog/docs
  • implementation
  • implementation using heaps

3 DIMENSIONAL

  • blog/docs
  • implementation
  • implementation using heaps

4 DIMENSIONAL

  • blog/docs
  • implementation
  • complexity

INBUILT

ARRAYS CLASS(JAVA)

  • blog/docs
  • implementation
  • complexity

ARRAY CLASS(C++)

  • blog/docs
  • array class in c++
  • complexity

MISC ARRAYS

JAGGED

  • blog/docs
  • implementation
  • complexity

SPIRAL ORDER MATRIX

  • blog/docs
  • implementation
  • complexity

Rotate 1 D Array to left by K

  • blog/docs
  • implementation
    • APPROACH 1: Rotate array using temp array
    • APPROACH 2: Rotate array using single element
    • APPROACH 3: Rotate array using Juggling Algorithm
  • complexity

:octocat: STRING

  • blog/docs
  • implementation
  • complexity

:octocat: LISTS

SINGLE

DOUBLE

CIRCULAR

INBUILT LISTS

ARRAYLIST

  • blog/docs
  • implementation
  • complexity

VECTOR

  • blog/docs
  • implementation
  • complexity

LINKED LIST

LIST PY

  • blog/docs
  • implementation
  • complexity

MISC LISTS

Find the nth node from end in single linked list

  • blog/docs
  • implementation

    • APPROACH 1: Compute the size while adding

    • APPROACH 2: Using two current pointers

    • APPROACH 3: Using hashtable

    • APPROACH 4: Using Hashtable while adding

    • APPROACH 5: Finding node in one scan

    • APPROACH 6: Using recursion

  • complexity

:octocat: STACKS

FIXED ARRAY STACK

  • blog/docs
  • implementation
  • complexity

DYNAMIC ARRAY STACK

  • blog/docs
  • implementation
  • complexity

LINKED STACK

  • blog/docs
  • implementation
  • complexity

INBUILT STACKS

  • blog/docs
  • implementation
  • complexity

MISC STACKS

Minimum bracket reversal for making brackets balanced

  • blog/docs
  • implementation
  • complexity

Given expression has balanced brackets or not

  • blog/docs
  • implementation
  • complexity

Infix Evaluation

  • blog/docs
  • implementation
  • complexity

Postfix Evaluation

  • blog/docs
  • implementation
  • complexity

TWO WAY STACK

  • blog/docs
  • implementation
  • complexity

:octocat: QUEUES

SIMPLE QUEUE

FIXED ARRAY SIMPLE QUEUE

  • blog/docs
  • implementation
  • complexity

DYNAMIC ARRAY SIMPLE QUEUE

  • blog/docs
  • implementation
  • complexity

LINKED SIMPLE QUEUE

  • blog/docs
  • implementation
  • complexity

CIRCULAR QUEUE

FIXED ARRAY CIRCULAR QUEUE

  • blog/docs
  • implementation
  • complexity

DYNAMIC ARRAY CIRCULAR QUEUE

  • blog/docs
  • implementation
  • complexity

LINKED CIRCULAR QUEUE

  • blog/docs
  • implementation
  • complexity

PRIORITY QUEUE

FIXED ARRAY PRIORITY QUEUE

LINKED PRIORITY QUEUE

  • blog/docs
  • implementation
  • complexity

HEAPED PRIORITY QUEUE

  • blog/docs
  • implementation
  • complexity

:octocat: TREES

BINARY TREES

TRAVERSALS

DEPTH FIRST SEARCH
BREADTH FIRST SEARCH
  • LEVEL ORDER

MISC

BOTTOM VIEW OF A TREE

GENERIC TREES

THREADED BINARY TREE

XOR TREES

BINARY SEARCH TREE

AVL TREES

RED BLACK TREES

SPLAY TREES

AUGMENTED TREES

SCAPEGOAT TREES

INTERVAL TREES

HEAP TREE

:octocat: GRAPHS

:octocat: BLOCKCHAIN