Home
Data Structure Tutorial
Data structure is logical or mathematical organization of data; it describes how to store the data and access data from memory. Actually in our programming data stored in main memory(RAM) and To develop efficient software or firmware we need to care about memory. To efficiently manage we required data structure.
There are two different types of data structure:
- Linear Data Structure
In linear data structure data elements stored in sequential manner. Stack, Queue and Linked List are the types of linear data structure
- Non Linear Data Structure
In Non-Linear data structure data elements are not stored in the sequence manner. Tree and Graph are the type of non-linear data structure.
Topics of Data Structure
TREE
- Introduction to Trees and its terminologies.
Learn: In this article we are going to study about introduction of trees. What is generalized tree? What are different terminologies of tree? Why we use trees? What are benefits of use of trees?
- Binary tree, Definition and its properties.
Learn: In this article we are going to study about the basics of binary tree. We study different types of binary tree like complete Binary Tree, Strictly Binary Tree, Extended Binary Tree, And Full Binary Tree? What are the uses of binary tree? How binary tree is different from general tree?
- Binary Tree representation (Sequential and Link).
Learn: In this article we are going to study about the representation of binary tree. What are the different representations of trees in the memory? What is linked list representation of binary tree? What is sequential representation of binary tree?
- Traversal technique for Binary Tree.
Learn: In this article, we will learn about Traversal technique for Binary tree with their algorithms and example.
- Insertion in Binary Search Tree (BST).
Insertion in Binary Search Tree: Here, we will learn how to insert a Node in Binary Search Tree. In this article you will find algorithm, example in C++.
- Deletion in Binary Search Tree (BST).
Deletion in Binary Search Tree: Here, we will learn how to delete a Node in Binary Search Tree. In this article you will find algorithm, example in C++.
- Find Height (Maximum Depth) of a Binary Search Tree (C++ program).
Learn: How to find the height or maximum depth of a binary search tree? This article includes definition, algorithm and implementation in C++ program.
- Find the Number of Nodes in a Binary Search Tree (C++ program).
Learn: How to find the total number of nodes in a binary search tree using C++ program?
- AVL Tree, Left and right rotations.
Learn: In this article, we are going to learn what is AVL tree? And how to use left and right rotations in an AVL tree?
- Introduction to B Tree and its operations
Learn: In this article, we are going to study about B-trees and the various operations performed on B tree i.e. insertion in B tree and deletion from B tree. Applications of a B tree are also prescribed in this article.
- Red Black Tree (Properties, Advantages, Inserting Nodes).
Learn: In this article, we are going to study about Red Black tree and How to insert a node in a Red Black tree (insertion operation in RB tree)? Properties and advantages of Red Black Tree are also prescribed in this article.
- Interval Tree in Data Structure.
In this article, we are going to discuss about the interval Tree, algorithm for searching in Interval tree and the augment of interval tree in data structure.
- Threaded Binary Tree | Data Structure.
In this article, we will learn about the introduction of threaded binary tree, types of threaded binary tree and the advantages, disadvantages of threaded binary tree in data structure.
MISC.
- Augmenting Data Structure.
In this article, we will learn what Augmenting Data Structure is and how to represent an augmented data structure? Augmentation strategies and algorithm for determining the rank of a particular node in a order static tree also prescribed in this article.
- Tail Recursion and Tower of Hanoi using C.
Learn: In this article we are going to study about the tail recursion and we are going to deal with the famous problem of tail recursion TOWER OF HANOI.
- Asymptotic Notations.
Learn: What are Asymptotic Notations? How they are used to express the time complexity of algorithm?
- Hashing (Hash table, Hash functions and its characteristics).
In this article, we are going to study about Hashing, Hash table, Hash function and the types of hash function. Characteristics of good hash function and collision resolution technique are also prescribed in this article.
- Hamiltonian Cycle in Data Structure.
In this article, we learn about the Hamiltonian cycle and how it can we solved with the help of backtracking?
Was this page helpful? Please share with your friends...
Are you a blogger? Join our Blogging forum.