Java Algorithm – Swap nodes in a linked list without swapping data – Linked List – Given a linked list and two keys in it, swap nodes for two given keys
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.
Sorted insert for circular linked list – Circular Linked List – Write a C function to insert a new value in a sorted Circular Linked List.
C Algorithm – Swap nodes in a linked list without swapping data – Linked List – Given a linked list and two keys in it, swap nodes for two given keys
Binary Tree (Types of Binary Tree) – A Binary tree is Perfect Binary Tree in which all internal nodes have two children and all leaves are at same level.
Applications of Queue Data Structure
Queue is used when things don’t have to be processed immediatly, but have to be processed in First In First Out order
Data Structure for a single resource reservations-Binary Search Tree-Every job requires exactly k time units of the machine. The machine can do only one job
How to write C functions that modify head pointer of a Linked List? – Linked List – Consider simple representation (without any dummy node)
Java programming queue data structure linked list implementation In the previous post, we introduced Queue and discussed array implementation
Advantages of BST over Hash Table – Binary search tree – The time complexity of above operations in a self-balancing Binary Search Tree (BST) is O(Logn).
Python Program – Binary Tree (Introduction) – A tree whose elements have at most 2 children is called a binary tree. Let us create a simple tree with 4 node