C Algorithm – Move last element to front of a given Linked List – Linked List – Write a C function that moves last element to front in a given Singly
Data Structures
53 Articles
53
C Algorithm – Iterative Postorder Traversal | Set 2 (Using One Stack) – Stack – We have discussed a simple iterative postorder traversal using two stacks
C Algorithm – Move last element to front of a given Linked List – Linked List – Write a C function that moves last element to front in a given Singly
Cpp Algorithm-Rearrange a Linked List in Zig-Zag fashion-Linked list
Given a linked list, rearrange it such that converted list should be
Python Algorithm – Move last element to front of a given Linked List – Linked List – Write a C function that moves last element to front in a given Singly
Cpp Algorithm – Move last element to front of a given Linked List – Linked List – Write a C function that moves last element to front in a given Singly
inorder tree travesal without recursion – Using Stack is the obvious way to traverse tree without recursion.Below is an algorithm for traversing binary tree
Prim’s algorithm using priority_queue in STL – STL Implementation of Algorithms – Given an undirected, connected and weighted graph, find Minimum Spanning
Heap sort is a comparison based sorting technique based on Binary Heap data structure. It is similar to selection sort where we first find the maximum element and place the…
Cpp Algorithm-Add 1 to a number represented as linked list-Linked list
Number is represented in linked list such that each digit corresponds