Content-Length: 257732 | pFad | http://github.com/imfaisalmalik/Python-Data-Structures

52 GitHub - imfaisalmalik/Python-Data-Structures: Python Data Structures
Skip to content

imfaisalmalik/Python-Data-Structures

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Python-Data-Structures

This Repository contain the source code and example questions of different Python Data Structures.

There are two types of Data Structures Algrithms:

i) Linear Data Structures

  1. Stack
  2. Queue
  3. Hash Map / Hash Table
  4. Linked List
  • Single Linked List
  • Doubly Linked List
  • Circular Linked List
  1. Heap
  • Max Heap
  • Min Heap

ii) Non-Linear Data Structures

  1. Tree
  2. Binary Search Tree (BST)
  • In-order Traversal ~ Left, Node, Right (LNR)
  • Pre-order Traversal ~ (NLR)
  • Post-order Traversal ~ (LRN)
  1. Graphs

1. Stack

Stack is a linear data structure. It works on the principle of Last-In-First-Out (LIFO).









ApplySandwichStrip

pFad - (p)hone/(F)rame/(a)nonymizer/(d)eclutterfier!      Saves Data!


--- a PPN by Garber Painting Akron. With Image Size Reduction included!

Fetched URL: http://github.com/imfaisalmalik/Python-Data-Structures

Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy