Open
Conversation
A JavaScript class to help solve problems related to stack like the Parenthesis problem
Implementation of merge sort in python
Implementation of Stacks in JS
Image verification
Reading display array
A priority queue is an abstract data type in which each element additionally has a "priority" associated with it. In a priority queue, an element with high priority is served before an element with low priority
priority Queue implementation in c language.
This code implements various operations of Binary Search Tree.
Binary search tree implementation in c language.
Create Binary_tree.cpp
Create bfs.cpp
The problem here is simpler as we don’t need to create a circular DLL, but a simple DLL. The idea behind its solution is quite simple and straight. If the left subtree exists, process the left subtree Recursively convert the left subtree to DLL. Then find the inorder predecessor of the root in the left subtree (the inorder predecessor is the rightmost node in the left subtree). Make the inorder predecessor as the previous root and the root as the next in order predecessor. If the right subtree exists, process the right subtree (Below 3 steps are similar to the left subtree). Recursively convert the right subtree to DLL. Then find the inorder successor of the root in the right subtree (in order the successor is the leftmost node in the right subtree). Make the inorder successor the next root and the root the previous inorder successor. Find the leftmost node and return it (the leftmost node is always the head of a converted DLL).
Data structures
Added selection sort
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
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
9 participants
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.
No description provided.