Python Program – Inorder Tree Traversal without recursion and without stack!
Inorder Tree Traversal without recursion and without stack! - Using Morris Traversal, we can traverse the tree without using...
Browse Category
Data Structures
224 Articles
Detect Cycle in a directed graph using colors
Detect Cycle in a directed graph using colors-Graph cycle-Depth First Traversal can be used to detect cycle in a Graph. DFS...
python programming Heap Sort
Heap sort is a comparison based sorting technique based on Binary Heap data structure. It is similar to selection sort where...
Intersection of two Sorted Linked Lists
Intersection of two Sorted Linked Lists - Linked List - Given two lists sorted in increasing order, create and return a new...
Java Algorithm – Iterative Postorder Traversal | Set 2 (Using One Stack)
Java Algorithm - Iterative Postorder Traversal | Set 2 (Using One Stack) - Stack - We have discussed a simple iterative...
Cpp Algorithm-Rearrange a linked list such that all even and odd positioned nodes are together
Rearrange a linked list such that all even and odd positioned nodes are together-linked list Rearrange a linked list in...
Python Algorithm – Iterative Postorder Traversal | Set 2 (Using One Stack)
Python Algorithm - Iterative Postorder Traversal | Set 2 (Using One Stack) - Stack - We have discussed a simple iterative...
java programming Heap Sort
Heap sort is a comparison based sorting technique based on Binary Heap data structure. It is similar to selection sort where...
C Program – Inorder Tree Traversal without recursion and without stack!
Inorder Tree Traversal without recursion and without stack! - Using Morris Traversal, we can traverse the tree without using...
Java Programming – Design a data structure that supports insert, delete, search and getRandom in constant time
The idea is to use a resizable array (ArrayList in Java, vector in C) together with hashing. Resizable arrays support insert...
