Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

Python Data Structures

License

NotificationsYou must be signed in to change notification settings

imfaisalmalik/Python-Data-Structures

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 
 
 

Repository files navigation

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).

[8]ページ先頭
©2009-2025 Movatter.jp