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...
PYTHON programming Fleury’s Algorithm for printing Eulerian Path or Circuit
PYTHON programming Fleury’s Algorithm for printing Eulerian Path or Circuit - learn in 30 sec from microsoft awarded...
C Algorithm – Move last element to front of a given Linked List
C Algorithm - Move last element to front of a given Linked List - Linked List - Write a C function that moves last element...
C Algorithm – Iterative Postorder Traversal | Set 2 (Using One Stack)
C Algorithm - Iterative Postorder Traversal | Set 2 (Using One Stack) - Stack - We have discussed a simple iterative...
C Algorithm – Move last element to front of a given Linked List
C Algorithm - Move last element to front of a given Linked List - Linked List - Write a C function that moves last element...
