Binary Search Tree

Binary Tree

AVL Tree

Read Black Tree

Binary Min heap

Single Linked list

Doubly Linked list

Circular Single Linked list

Circular Doubly Linked list

Sorting

Category linked list

Spread the Category

Insertion of single linked list

Insert node at beginning of linked list

Single linked list insert node at middle position

Singly linked list insert data in ascending order

Search data on single linked list

Singly linked list insert data in descending order

Print middle element in single linked list

Single linked list to find nth last node

Single linked list print node data at alternate positions

Print reverse data on single linked list

Count number of node in single linked list

Delete duplicate data on single linked list

Single linked list delete node in given position

Single linked list delete middle element

Single linked list delete any node

Single linked list check identical linked lists

Swap alternate nodes of single linked list

Move last node to front of linked list

Move the first node at end of given linked list

Move first node a middle of given linked list

Move middle node at beginning of given linked list

Delete even key node of given linked list

Delete all odd key nodes from given linked list

Remove duplicates from sorted linked list

Selection sort linked list

Bubble sort on given linked list

Insert node at end of linked list

Delete last node from given linked list

Sum of elements in given linked list

Delete occurrences of given key in a linked list

Pairwise swap element of given linked list

Detect loop in a given linked list

Count occurrence of given node in linked list

Sum of last n terms in given linked list

Rotate linked list clockwise

Delete all nodes in linked list

Palindrome linked list

Delete alternate nodes of a linked list

Intersection of two linked lists

Find second last element in linked list

Union of two linked list

Find max value in linked list

Segregate even and odd nodes in a Linked List

Find length of linked list using recursion

Delete middle N nodes of linked list

Delete first half nodes of beginning in Linked List

Reverse middle N nodes in linked list

Remove every k th node of the linked list

Get element at specific index of linked list

Reverse a linked list

Program to delete first node in linked list

Sum of even and odd nodes in a linked list

Move first node at given position in linked list

Move last node at given position in linked list

Move middle N node in beginning of linked list

Move middle N node in end of linked list

Print middle N nodes of linked list

Move a given occurrences at end of linked list

Move a given occurrences at beginning of linked list

Reverse a linked list from position M to N

Split a linked list into two halves

Sum of N middle nodes of linked list

Find minimum value in linked list

Count Odd key nodes of linked list

Remove nth node from end of linked list

Insert a node after the Kth node from the end

Remove half nodes from end of linked list

Merge two sorted linked lists

Reverse first half nodes at beginning of linked list

Reverse second half of linked list

Sort a linked list of 0s 1s and 2s

Reverse a linked list using recursion

Move last n node at beginning of linked list

Length of loop in linked list

Check palindrome in linked list loop

Delete all nodes which are less than of right side node

Delete nodes greater than specified value from linked list

Arrange linked list around given value x

Split alternate nodes of linked list

Delete adjacent duplicate nodes in linked list

Decimal equivalent of binary linked list

Count maximum pair of similar adjacent nodes in linked list

Delete max-length same adjacent nodes of linked list

Delete linked list nodes there not contain zig-zag views

Move similar group nodes at beginning of linked list

Convert multi level linked list into single level

Introduction of doubly linked list

Array [18]

Queue [11]

Stack [9]

Linked List [87]

Tree [74]

C Program [30]

Oops [8]

Searching And Sorting [3]

C Recursion [7]