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...
Cpp Algorithm-Rearrange a Linked List in Zig-Zag fashion
Cpp Algorithm-Rearrange a Linked List in Zig-Zag fashion-Linked list Given a linked list, rearrange it such that converted...
Java Algorithm – Move last element to front of a given Linked List
Python Algorithm - Move last element to front of a given Linked List - Linked List - Write a C function that moves last...
Cpp Algorithm – Move last element to front of a given Linked List
Cpp Algorithm - Move last element to front of a given Linked List - Linked List - Write a C function that moves last element...
Python Program – Inorder Tree Traversal without Recursion
inorder tree travesal without recursion - Using Stack is the obvious way to traverse tree without recursion.Below is an...
