Working With Data Structure in C++

Topics

Arrays:-

1. Insertion
2. Traversal
3. Deletion
4. Merging
5. Merging Two Sorted Array
6. Copying One Array into Another
7. Counting Each Element Frequency
8. Matrix Multiply

Recursion :-

1. Printing n numbers
2. Sum of n natural number
3. Factorial of number
4. Power of number
5. Fibonacci sum
6. Combination Problem( nCr )
7. Tower of Hanoi

Strings :-

1. Length
2. Reverse
3. Vowels, Consonents and Words Count
4. Validation of String
5. Changing Cases(UPPER & LOWER)
6. Compare
7. Palindrome

Linked List:-

FILE NAME :-
a. createLinkedList1 => Singly Linked List
b. createLinkedList2 => Doubly Linked List
b. createLinkedList3 => Circular Linked List

1. Singly Linked List
   => Created List
   => Print List
   => insert at Beginning
   => insert at End
   => Count Number of Element
   => insert at Specific Position
   => delete Element at Beginning
   => delete Element at End
   => delete at Specific Position
   => search Element
   => Reverse List using Iteration
   

2. Doubly Linked List
   => Created List
   => Print List
   => insert at Beginning
   => insert at End
   => insert Element at Specific Position
   => Count Number of Element
   => delete Element at Beginning
   => delete Element from End
   => reverse List using Iteration
   

3. Circular Linked List
   => Created List
   => Print List
   => insert at Beginning
   => insert at End
   => insert at Specific position
   => delete at Beginning
   => delete at End
   => delete at Specific Position
   => reverse List
   

Searching & Sorting:-

1. Linear Search

2. Binary Search

3. Jump Search -- Lef

4. Bubble Sort

5. Insertion Sort

6. Selection Sort

7. Quick Sort

8. Merge Sort

Stack

1. Array Implementation
2. Linked List Implementation
3. Balance Paranthesis

Queue

1. Array Implementation

2. Linked List Implementation

   Circular Queue

   1. Array Implementation
   2. Linked List Implementation : Simillar to Circular Linked List

   Doubly Ended Queue

   1. Array Implementation

3. Stack Implementation

Tree

1. Binary Tree
   => Create
   => Insert Method
   => In-Order Traversal (Recursive)
   => Pre-Order Traversal (Recursive)
   => Post-Order Traversal (Recursive)
   => Level Order Traversal
   => In-Order Traversal (Iterative)
   => Pre-Order Traversal (Iterative)
   => Post-Order Traversal (Iterative)
   => Count Number of Nodes
   

2. Binary Search Tree
   => Creation
   => Searching
   => Insertion using Iteration
   => Insertion using Recursion
   => In-Order Traversal
   => Deletion
   => In-Order Successor Function
   => In-Order Predecessor
   => BST Generation From Pre-order
   

3. AVL Tree
   => Creation
   => Insertion
   => Deletion
   => Searching
   

4. Heap & Heap Sort
   

Hashing

STL