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...
Browse Category
Data Structures
224 Articles
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...
Prim’s algorithm using priority_queue in STL
Prim’s algorithm using priority_queue in STL - STL Implementation of Algorithms - Given an undirected, connected and...
C++ programming Heap Sort
Heap sort is a comparison based sorting technique based on Binary Heap data structure. It is similar to selection sort where...
Cpp Algorithm-Add 1 to a number represented as linked list
Cpp Algorithm-Add 1 to a number represented as linked list-Linked list Number is represented in linked list such that each...
