Queue-Data Structure-Priority Queue
Priority Queue - Priority Queue is an extension of queue with following properties. Every item has a priority associated...
Binary Tree (Properties)
Binary Tree Properties - Binary Tree - Here level is number of nodes on path from root to the node (including root and...
Swap nodes in a linked list without swapping data
Python Algorithm - Swap nodes in a linked list without swapping data - Linked List - Given a linked list and two keys in it,...
C++ Algorithm – Implement two stacks in an array
Cpp Algorithm - Implement two stacks in an array - Data Structure - Create a data structure twoStacks that represents two...
Swap nodes in a linked list without swapping data
Java Algorithm - Swap nodes in a linked list without swapping data - Linked List - Given a linked list and two keys in it,...
Sorted insert for circular linked list
Sorted insert for circular linked list - Circular Linked List - Write a C function to insert a new value in a sorted...
C Algorithm – Swap nodes in a linked list without swapping data
C Algorithm - Swap nodes in a linked list without swapping data - Linked List - Given a linked list and two keys in it, swap...
Binary Tree | Set 3 (Types of Binary Tree)
Binary Tree (Types of Binary Tree) - A Binary tree is Perfect Binary Tree in which all internal nodes have two children and...
Queue-Data Structure-Applications of Queue Data Structure
Applications of Queue Data Structure Queue is used when things don’t have to be processed immediatly, but have to be...
Data Structure for a single resource reservations
Data Structure for a single resource reservations-Binary Search Tree-Every job requires exactly k time units of the machine....
