Home

Let's start with the Basic Data Structure

• Stack
  • Stack using linked list
  • Reverse Stack Data
  • Infix to Postfix Conversion
  • Postfix Evaluation
• Linked-List
  • Create a Linked-list
  • Insert a node in the end of Linked-list
  • Multiple operation on a linked list
  • Add a node just before last node
  • Create a Search of a number in a Linked-list
  • Sort a given Linked-list
  • Circular Linked-list
  • Double Linked-list
• Queue
  • Queue using array
  • Queue using stack
  • Queue using linked list
• Trees
  • Binary Tree
    • Create a binary Tree
    • Tree Traversal recursive
    • Tree Traversal iterative
      • Inorder Traversal using Stack
      • Inorder Morris Traversal
      • Preorder Traversal using Stack
      • Postorder Traversal using two Stack
      • Postorder Traversal using one Stack
    • Count half node in a tree
    • Count full node in a tree
    • Count leaf node in a tree
    • Check whether two trees are identical or not
      • Iterative Approach
      • Recursive Approach
    • Size of binary tree
      • Iterative Approach
      • Recursive Approach
    • Height of binary tree
      • Iterative Approach
      • Recursive Approach
    • Root to leaf sum of a tree
    • Level By Level printing of binary tree
      • Using two queues
      • Using one queue
    • Spiral order Traversal of binary tree
      • Using two stacks
      • Using one queue
    • Lowest common ancestor of a binary tree
  • Binary Search Tree
    • Binary Search Tree Insertion
    • Binary Search Tree Deletion
    • Binary Search Tree Searching
    • Lowest Common Ancestor in a binary search tree
    • Check if Binary Tree is Binary Search Tree
    • Largest Binary Search Tree