C Algorithm – Find the middle of a given linked list – Linked List – Given a singly linked list, find middle of the linked list
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.
Java Algorithm – Find the middle of a given linked list – Linked List – Given a singly linked list, find middle of the linked list
C++ programming Binary heap – Binary heap – It’s complete tree (All levels are completely filled except possibly the last level and the last level).
Java Program – Find the node with minimum value in a Binary Search Tree – Just traverse the node from root to left recursively until left is NULL.
JAVA Programming – Biconnected graph,An undirected graph is called Biconnected if there are two vertex-disjoint paths between any two vertices.
Queue Data Structure Deque – Data Structure – Deque or Double Ended Queue is a generalized version of Queue data structure that allows insert and delete.
C Program Find the node with minimum value in a Binary Search Tree-Binary Search Tree-. traverse the node from root to left recursively until left is NULL.
Sorted insert for circular linked list – Circular linked list – Write a C function to insert a new value in a sorted Circular Linked List.
Enumeration of Binary Trees – Binary Tree – Number of Binary Search Trees (BST) with n nodes is also same as number of unlabeled trees.
Sorted insert for circular linked list – Circular Linked List – Write a C function to insert a new value in a sorted Circular Linked List.