Cpp Algorithm – Delete alternate nodes of a Linked List
Cpp Algorithm - Delete alternate nodes of a Linked List - Linked List - Given a Singly Linked List, starting from the second...
Author
Venkatesan Prabu
Wikitechy Founder, Author, International Speaker, and Job Consultant. My role as the CEO of Wikitechy, I help businesses build their next generation digital platforms and help with their product innovation and growth strategy. I'm a frequent speaker at tech conferences and events.
2835 Articles
C Algorithm – Delete alternate nodes of a Linked List
C Algorithm - Delete alternate nodes of a Linked List - Linked List - Given a Singly Linked List, starting from the second...
C Algorithm – Iterative Postorder Traversal | Set 1 (Using Two Stacks)
C Algorithm - Iterative Postorder Traversal | Set 1 (Using Two Stacks) - Stack - We have discussed iterative inorder and...
Cpp programming-Compare two strings represented as linked lists
Compare two strings represented as linked lists-Linked list Given two linked lists, represented as linked lists (every...
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...
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...
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...
