1) Linear Data Structure:- Data elements are organized sequentially and they are easy to implement, Example: Array and Linked List.
2) Non-Linear Data Structure:- Data elements are not organized sequentially and can be attached to several other data elements, Example: Tree and Graph.
Here, we have given list of Data Structure programs and tutorials:-
Note:- To learn algorithm of data structure programs, check videos on my YouTube channel.
★ Code Gladiators 2015 Programs
★ Binary Search Tree
★ Postfix Expression
★ Binary Search Tree without using recursion
★ Binary Search Tree using father field
★ Threaded Binary Search Tree
★ AVL Tree
★ BFS and DFS
★ Binary Tree
★ BFS and DFS
★ Binary Tree
★ B Tree
★ Postfix Expression evaluation
★ Heap tree
★ Convert given INFIX expression into POSTFIX expression
★ Convert given INFIX expression into PREFIX expression
★ All operation of a Link List in a single program
★ Merge Sort algorithm
★ Merge Sort using C++
★ Heap Sort using C++
★ Insertion Sort using C++
★ Quick Sort using C++
★ Randomized Quick sort using C++
★ Two stack operation in a single stack program
★ Quick Sort algorithm
★ Binomial Heap Tree
★ Fibonacci Heap Tree
★ Insert, delete and display elements from stack
★ Insert, delete and display from Linear Queue
★ Insert, delete and display from Circular Queue
★ Insert, delete and display from Dequeue
★ Append element at the end of Link List
★ Concatenate two Link Lists
★ Free all nodes in a Link List
★ Postfix Expression evaluation
★ Heap tree
★ Convert given INFIX expression into POSTFIX expression
★ Convert given INFIX expression into PREFIX expression
★ All operation of a Link List in a single program
★ Merge Sort algorithm
★ Merge Sort using C++
★ Heap Sort using C++
★ Insertion Sort using C++
★ Quick Sort using C++
★ Randomized Quick sort using C++
★ Two stack operation in a single stack program
★ Quick Sort algorithm
★ Binomial Heap Tree
★ Fibonacci Heap Tree
★ Insert, delete and display elements from stack
★ Insert, delete and display from Linear Queue
★ Insert, delete and display from Circular Queue
★ Insert, delete and display from Dequeue
★ Append element at the end of Link List
★ Concatenate two Link Lists
★ Free all nodes in a Link List
★ Reverse a Link List
★ Delete last element of Link List
★ Delete nth element of Link List
★ Delete last element of Link List
★ Delete nth element of Link List
★ Combine two ordered link list into single ordered Link List
★ Find Union of two Link Lists
★ Find Intersection of two Link Lists
★ Insert after nth element in a Link List
★ Find Union of two Link Lists
★ Find Intersection of two Link Lists
★ Insert after nth element in a Link List
★ Delete every second element of a Link List
★ Place elements in order in a Link List
★ Calculate sum of data of a Link List
★ Calculate number of elements in a link List
★ Place elements in order in a Link List
★ Calculate sum of data of a Link List
★ Calculate number of elements in a link List
★ Make second copy of a Link List
★ Move node forward to nth positions in a Link List
Hope you all like my work..than share this site with your friends to help. Come and be a part of coders-hub...Let's Spread The Technology!!!
★ Move node forward to nth positions in a Link List
Hope you all like my work..than share this site with your friends to help. Come and be a part of coders-hub...Let's Spread The Technology!!!
