# Category - Data StructuresArraysBinary Search TreeBinary TreeGraphHashingHeapLinked ListMatrixQueueStack

## 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 example, if given array is [1, 23...

## 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 and iterative preorder traversals.

## Java programming-Compare two strings represented as linked lists

Given two linked lists, represented as linked lists every character is a node

## 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 second node delete all alternate

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...

## 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 node delete all alternate

## 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 node delete all alternate

## 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 iterative preorder traversals