k largest(or smallest) elements in an array | added Min Heap method
Question: Write an efficient program for printing k largest elements in an array. Elements in array can be in any order. For...
Browse Category
Data Structures
224 Articles
Python Algorithm – Iterative Postorder Traversal | Set 1 (Using Two Stacks)
Python Algorithm - Iterative Postorder Traversal | Set 1 (Using Two Stacks) - Stack - We have discussed iterative inorder...
Java programming-Compare two strings represented as linked lists
Java programming-Compare two strings represented as linked lists-Linked list Given two linked lists, represented as linked...
Delete alternate nodes of a Linked List
Java Algorithm - Delete alternate nodes of a Linked List - Linked List - Given a Singly Linked List, starting from the...
Threaded Binary Tree
Threaded Binary Tree - learn in 30 secfrom microsoft awarded MVP,Inorder traversal of a Binary tree is either be done using...
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...
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...
