This repository was archived by the owner on Sep 7, 2025. It is now read-only.
- Notifications
You must be signed in to change notification settings - Fork174
Added data structure#134
Open
Vishesh-dd4723 wants to merge1 commit intoAllAlgorithms:masterChoose a base branch
base:master
Could not load branches
Branch not found:{{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline, and old review comments may become outdated.
Uh oh!
There was an error while loading.Please reload this page.
Open
Changes fromall commits
Commits
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Uh oh!
There was an error while loading.Please reload this page.
Jump to
Jump to file
Failed to load files.
Loading
Uh oh!
There was an error while loading.Please reload this page.
Diff view
Diff view
There are no files selected for viewing
52 changes: 52 additions & 0 deletionsalgorithms/data-structures/linked-lists/doubly linked list.py
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,52 @@ | ||
| class Node: | ||
| def __init__(self, value): | ||
| self.value = value | ||
| self.next = None | ||
| self.prev = None | ||
| class DoublyLinkedList: | ||
| def __init__(self, object): | ||
| self.tail = self.head = Node(object) | ||
| def append(self, object): | ||
| c = self.tail | ||
| self.tail.next = Node(object) | ||
| self.tail = self.tail.next | ||
| self.tail.prev = c | ||
| def insert(self, index, object): | ||
| new_node = Node(object) | ||
| if index == 0: | ||
| ll = new_node | ||
| self.head.prev = ll | ||
| ll.next = self.head | ||
| self.head = ll | ||
| else: | ||
| current_indx = 0 | ||
| ll = self.head | ||
| while current_indx < index - 1: | ||
| ll = ll.next | ||
| current_indx += 1 | ||
| ll.next.prev = new_node | ||
| new_node.next = ll.next | ||
| ll.next = new_node | ||
| new_node.prev = ll | ||
| def pop(self): | ||
| curr = self.head | ||
| while curr.next.next != None: | ||
| curr = curr.next | ||
| self.tail = curr | ||
| self.tail.next = None | ||
| def show(self, reverse = False): | ||
| if reverse: | ||
| curr = self.tail | ||
| while curr: | ||
| print(curr.value) | ||
| curr = curr.prev | ||
| else: | ||
| curr = self.head | ||
| while curr: | ||
| print(curr.value) | ||
| curr = curr.next |
43 changes: 43 additions & 0 deletionsalgorithms/data-structures/queue/queue.py
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,43 @@ | ||
| class Node(): | ||
| def __init__(self, data): | ||
| self.data = data | ||
| self.next = None | ||
| self.prev = None | ||
| class Queue(): | ||
| def __init__(self): | ||
| self.tail = self.head = None | ||
| self.length = 0 | ||
| def insert(self, object): | ||
| if self.length == 0: | ||
| self.tail = self.head = Node(object) | ||
| else: | ||
| c = Node(object) | ||
| self.head.prev = c | ||
| c.next = self.head | ||
| self.head = c | ||
| self.length += 1 | ||
| def pop(self): | ||
| if self.length == 1: | ||
| value = self.tail.data | ||
| self.tail = self.head = None | ||
| else: | ||
| c = self.tail.prev | ||
| value = self.tail.data | ||
| c.next = None | ||
| self.tail = c | ||
| self.length -= 1 | ||
| return value | ||
| def isEmpty(self): | ||
| return not bool(self.length) | ||
| def show(self): | ||
| curr = self.head | ||
| lst = [] | ||
| while curr: | ||
| lst.append(curr.data) | ||
| curr = curr.next | ||
| return lst |
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.