Skip to main content
Home
  • Home
  • Learn
    • Courses
      • Programming in C
      • Operating Systems
      • Mathematics
      • Digital Logic Design
      • Database Management System
      • Data Structures
      • Computer Organisation
      • Computer Networks
      • Compiler design
      • Algorithms
      • Theory of Computation
  • Practise
    • Doubts
    • Solved Examples
    • Virtual GATE
  • Quiz
  • Class Rooms
  • Blog
  • More
    • Reach to us
      • Contact Us
      • Request a Topic
      • Join us
      • Internship
      • Teach with Techtud
      • GATE 2018 Feedback
    • Your Interview
      • Professor's Interview
      • Research Scholar's Interview
      • Exam topper's interview
    • About
      • About Techtud
      • The Team
      • User Levels and Credentials
      • Benefits
      • Earn Techtud Tee
Data Structures
  • Array
  • Stacks
    • Introduction
    • Representation of Stack
    • Operations on Stack
      • Pop operation
      • Peak operation
      • Push operation
      • isEmpty operation
      • isFull operation
  • Queue
    • Introduction
    • Representation of Queue
    • Operations on Queue
      • Enqueue operation
      • Dequeue operation
      • Peek operation
      • isEmpty operation
      • isFull operation
  • Linked List
    • Single Linked List
      • Operations on Linked List
    • Doubly Linked List
      • Operations on Doubly Linked List
    • Circular Linked List
      • Operations on Circular Linked List
  • Trees
    • Introduction
    • Binary Search Tree
      • Operations on binary search tree
      • Representation of binary search tree
    • Types of Binary Tree
      • Complete binary tree
      • Strictly binary tree
      • Strictly complete binary tree
    • Tree Traversal
      • In order traversal
      • Post order traversal
      • Pre order traversal
    • AVL Tree
      • Definition
      • AVL rotations
        • Left - right rotation
        • Left rotation
        • Right - left rotation
        • Right rotation
    • Spanning tree
      • Definition
      • Types on spanning tree
        • Kruskal’s spanning tree
        • Prim’s spanning tree
    • Heap Tree
      • Definition
      • Types of Heap Tree
        • Max. Heap
        • Min. Heap
  • Graphs
    • Introduction
    • Basic Terms Related to Graph
    • Depth First Search
    • Breadth First Search
  • Hashing
  • Expression passing
    • Definition
    • Parsing Expression
      • Association
      • Precedence
    • Types
      • Infix
      • Postfix
      • Prefix
  • Notes
  • Video
  • Example
  • Resource
  • Doubts
  • Quiz
Previous
Next

No content has been added under this section.

Please Contribute under section and help community grow.

Quick Links

  • Doubts

About

  • The Team
  • User Levels & Credentials

Reach to Us

  • Contact Us
  • Join Us
  • Request a Topic

Media Coverage

TOI
YS
BS

Subscribe

Proudly supported by OpenSense Labs