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, 12,…
Data Structures
53 Articles
53
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-Linked list
Given two linked lists, represented as linked lists every character is a node
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 auxiliary stack.
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.