Python Algorithm – Implement two stacks in an array
Python Algorithm - Implement two stacks in an array - Data Structure - Create a data structure twoStacks that represents two...
Author
Venkatesan Prabu
Wikitechy Founder, Author, International Speaker, and Job Consultant. My role as the CEO of Wikitechy, I help businesses build their next generation digital platforms and help with their product innovation and growth strategy. I'm a frequent speaker at tech conferences and events.
2834 Articles
Handshaking Lemma and Interesting Tree Properties
Handshaking Lemma and Interesting Tree Properties - Tree - Handshaking lemma is about undirected graph. In every finite...
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...
