Skip to content
Navigation Menu
Sign in
Appearance settings
Platform
AI CODE CREATION
GitHub Copilot
Write better code with AI
GitHub Copilot app
Direct agents from issue to merge
MCP Registry
Integrate external tools
DEVELOPER WORKFLOWS
Actions
Automate any workflow
Codespaces
Instant dev environments
Issues
Plan and track work
Code Review
Manage code changes
Code Quality
Enforce quality at merge
APPLICATION SECURITY
GitHub Advanced Security
Find and fix vulnerabilities
Code security
Secure your code as you build
Secret protection
Stop leaks before they start
EXPLORE
Why GitHub
Documentation
Blog
Changelog
Marketplace
View all features
Solutions
BY COMPANY SIZE
Enterprises
Small and medium teams
Startups
Nonprofits
BY USE CASE
App Modernization
DevSecOps
DevOps
CI/CD
View all use cases
BY INDUSTRY
Healthcare
Financial services
Manufacturing
Government
View all industries
View all solutions
Resources
EXPLORE BY TOPIC
AI
Software Development
DevOps
Security
View all topics
EXPLORE BY TYPE
Customer stories
Events & webinars
Ebooks & reports
Business insights
GitHub Skills
SUPPORT & SERVICES
Documentation
Customer support
Community forum
Trust center
Partners
View all resources
Open Source
COMMUNITY
GitHub Sponsors
Fund open source developers
PROGRAMS
Security Lab
Maintainer Community
GitHub Stars
Archive Program
REPOSITORIES
Topics
Trending
Collections
Enterprise
ENTERPRISE SOLUTIONS
Enterprise platform
AI-powered developer platform
AVAILABLE ADD-ONS
GitHub Advanced Security
Enterprise-grade security features
Copilot for Business
Enterprise-grade AI features
Premium Support
Enterprise-grade 24/7 support
Pricing
Search
/
Sign in
Sign up
Appearance settings
You signed in with another tab or window.
Reload
to refresh your session.
You signed out in another tab or window.
Reload
to refresh your session.
You switched accounts on another tab or window.
Reload
to refresh your session.
Dismiss alert
{{ message }}
TurkerKoc
/
Data-Structures
Public
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Issues
0
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
master
Branches
Tags
Go to file
Code
Open more actions menu
Latest commit
History
6 Commits
6 Commits
Folders and files
Name
Name
Last commit message
Last commit date
Add Node To the Sorted Linked List
Add Node To the Sorted Linked List
Add two numbers represented by linked lists
Add two numbers represented by linked lists
Array Manipulation
Array Manipulation
Balanced Brackets
Balanced Brackets
Binary Search Tree All
Binary Search Tree All
Binary Tree All
Binary Tree All
Bubble Sort
Bubble Sort
Build Minimum Height BST
Build Minimum Height BST
Circular Linked List ALL
Circular Linked List ALL
Deque Data Structure(Stack+Queue)
Deque Data Structure(Stack+Queue)
Detect and Remove Loop in a Linked List
Detect and Remove Loop in a Linked List
Doubly Linked List ALL
Doubly Linked List ALL
Equal Stacks
Equal Stacks
Game of Two Stacks
Game of Two Stacks
Graph - Adjacency List Implementation
Graph - Adjacency List Implementation
Graph Adjacency Matrix Implementation
Graph Adjacency Matrix Implementation
Heap Implementation
Heap Implementation
Insertion Sort
Insertion Sort
Linked List Bubble sort
Linked List Bubble sort
Merge Sorted LinkedLists
Merge Sorted LinkedLists
Move Zeros to the left
Move Zeros to the left
Queue Array implementation
Queue Array implementation
Queue Implementing using stack
Queue Implementing using stack
Queue Linked List implementation
Queue Linked List implementation
Queue implement k queues in a single array
Queue implement k queues in a single array
Queue priority Queue linked list
Queue priority Queue linked list
Remove nth node from end of the list
Remove nth node from end of the list
Reverse a Doubly Linked List
Reverse a Doubly Linked List
Selection Sort
Selection Sort
Singly Linked List All
Singly Linked List All
Sorting Linked List
Sorting Linked List
Sparse Array
Sparse Array
Split a Circular Linked List into two halves
Split a Circular Linked List into two halves
Stack Array implementation
Stack Array implementation
Stack Linked List implementation
Stack Linked List implementation
Stack Reverse String
Stack Reverse String
Stack check for balanced paranthesis
Stack check for balanced paranthesis
Stack implement k stacks in a single array
Stack implement k stacks in a single array
Stack implementation using Queues
Stack implementation using Queues
Swapping with next node
Swapping with next node
Term Project(Operations with Big Numbers)
Term Project(Operations with Big Numbers)
Threaded Binary Tree
Threaded Binary Tree
stack Next greater element
stack Next greater element
stack Stock Span problem
stack Stock Span problem
stack with operations on middle element
stack with operations on middle element
View all files
About
No description, website, or topics provided.
Activity
Stars
0
stars
Watchers
1
watching
Forks
0
forks
Report repository
Releases
Packages
Contributors
Languages
You can’t perform that action at this time.