Threaded Binary Tree – learn in 30 secfrom microsoft awarded MVP,Inorder traversal of a Binary tree is either be done using recursion or with the use of a auxiliary stack.
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.
Cpp Algorithm – Delete alternate nodes of a Linked List – Linked List – Given a Singly Linked List, starting from the second node delete all alternate
C Algorithm – Delete alternate nodes of a Linked List – Linked List – Given a Singly Linked List, starting from the second node delete all alternate
C Algorithm – Iterative Postorder Traversal | Set 1 (Using Two Stacks) – Stack – We have discussed iterative inorder and iterative preorder traversals
Compare two strings represented as linked lists-Linked list
Given two linked lists, represented as linked lists (every character is a node
Inorder Tree Traversal without recursion and without stack! – Using Morris Traversal, we can traverse the tree without using stack and recursion.
Inorder Tree Traversal without recursion and without stack! – Using Morris Traversal, we can traverse the tree without using stack and recursion.
Detect Cycle in a directed graph using colors-Graph cycle-Depth First Traversal can be used to detect cycle in a Graph. DFS for a connected graph.
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…
Intersection of two Sorted Linked Lists – Linked List – Given two lists sorted in increasing order, create and return a new list representing