https://github.com/sojebsikder/dsa

Data structure and algorithm implementation in JavaScript.
https://github.com/sojebsikder/dsa

algorithm data-structures dsa interview javascript js queue stack tree

Last synced: about 1 month ago
JSON representation

Data structure and algorithm implementation in JavaScript.

• Host: GitHub
• URL: https://github.com/sojebsikder/dsa
• Owner: SojebSikder
• Created: 2022-08-17T05:48:50.000Z (over 2 years ago)
• Default Branch: main
• Last Pushed: 2022-12-21T05:28:24.000Z (about 2 years ago)
• Last Synced: 2023-03-04T14:12:21.905Z (almost 2 years ago)
• Topics: algorithm, data-structures, dsa, interview, javascript, js, queue, stack, tree
• Language: JavaScript
• Homepage:
• Size: 15.6 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Data structure and Algorithm

Data structure and algorithm implementation using JavaScript.

## Data structure

- [Stack](/stack/stack.js)

- [Queue](/queue)

  - [Circular Queue](/queue/circular-queue.js)

  - [Priority Queue](/queue/priority-queue.js)

  - [Deque Queue](/queue/deque-queue.js)

- [Linked List](/linked-list/linked-list.js)

- [Hash Table](/hash-table/hash-table.js)

- [Heap](/heap/heap.js)

- [Tree](/tree)

  - [Tree Traversal](/tree/tree-traversal.js)

  - [Binary Tree](/tree/binary-tree.js)

  - [Full Binary Tree](/tree/full-binary-tree.js)

  - [Perfect Binary Tree](/tree/perfect-binary-tree.js)

  - [Complete Binary Tree](/tree/complete-binary-tree.js)

  - [Balanced Binary Tree](/tree/balanced-binary-tree.js)

  - [Binary Search Tree](/tree/binary-search-tree.js)

\*Will be adding more...

## Some terms:

**Tree:**

- **leaf/external node:** nodes without children are called leaf nodes or external nodes.

- **internal node:** The node having at least a child node is called an internal node.

- **edge:** It is the link between any two nodes.

- **Root:** It is the topmost node of a tree.

The node having at least a child node is called an internal node.

## Some good references for learning dsa

- https://www.programiz.com/dsa/

- https://www.geeksforgeeks.org/