Data Structures And Algorithms

Linked Lists:
Reverse a Linked List : click here
Check if the  list is palindrome:
Copy a list with random pointer:
Kth node from last:
Reverse first half of the list:
Pair wise revering the of a list:
Delete specific node, if head is not given:
Loop in a linked list:
Delete a node in Double linked list:
Delete a node in circular linked list:
Common node of two lists(Intersection node):
Even length or odd length:
Mid of a Linked list:
  
Trees:
To check a given tree is BST or not : click here
TRIE Data Structure Program : click here
Min HEAP Code : click here
Tree Operations : click here
How to find if there is a loop in graph : click here
Tree to Double linked list :
Find Min in a BST: click here
Find Max in BST:click here
Find kth Min a BST:click here
Find kth Max in BST:click here
Print all path from root to the leafs :click here
Print the path with given sum : click here
Least Common Ancestor or shortest path between nodes:click here
Mirror a tree:click here
Is Subtree : click here
BFS of a Tree: click here
Level wise sum:
Vertical Sum :
Print nodes with single child:
Zigzag traversal:
Build a binary tree from inorder and preorder:
Delete an element from a BST:
Range printing of a BST:


Stacks:
Minimum of stack:
Palindrome of a large string:
Find intersection node of lists using stack:
Finding spans or best stock price:

Queues:
Circular queue implementaion:

Arrays:

Other:
Find out next palindrome of a given number : click here