C Program – Inorder Tree Traversal without Recursion
inorder tree travesal without recursion - learn in 30 secfrom microsoft awarded MVP,Using Stack is the obvious way to...
Browse Category
Data Structures
224 Articles
Python Algorithm-Detect cycle in an undirected graph
Detect cycle in an undirected graph-Graph cycle-The time complexity of the union-find algorithm is O(ELogV). Like directed...
C Program-Find the largest BST subtree in a given Binary Tree
write a function that returns the size of the largest subtree which is also a Binary Search Tree (BST).
The Celebrity Problem
The Celebrity Problem - Stack - In a party of N people, only one person is known to everyone. Such a person may be present...
Fibonacci Heap
Heaps are mainly used for implementing priority queue. We have discussed below heaps in previous posts. Binary Heap Binomial...
Practice questions for Linked List and Recursion
Practice questions for Linked List and Recursion - Linked List - Assume the structure of a Linked List node is as follows.
Java Programming – Count distinct elements in every window of size k
An Efficient Solution is to use the count of previous window, while sliding the window. The idea is to create a hash map...
C++ Programming – Count distinct elements in every window of size k
An Efficient Solution is to use the count of previous window, while sliding the window. The idea is to create a hash map...
Cpp Algorithm-Point arbit pointer to greatest value right side node in a linked list
Cpp Algorithm-Point arbit pointer to greatest value right side node in a linked list-Linked list Given singly linked list...
C++ Algorithm-Detect cycle in an undirected graph
Detect cycle in an undirected graph-Graph cycle-The time complexity of the union-find algorithm is O(ELogV). Like directed...
