Tree data structure tutorial 3. Binary Tree Traversal
In this chapter we shall learn about: 3.1 Introduction to Tree Traversal 3.2 Types of tree traversal 3.3 Breadth first traversal. 3.4 Depth first traversal. 3.5 Pre Order Traversal: DLR 3.6 In Order Traversal: LDR 3.7 Post Order Traversal: LRD 3.1 Introduction to Tree Traversal A tree traversal can be defined as the process of […]
Tree data structure tutorial 2. Introduction to Binary Tree
In this chapter we shall learn about: 2.1. Introduction to binary tree 2.2. Examples of binary tree 2.3. Strict binary tree 2.4. Complete Binary Tree 2.5. Level of binary tree 2.6. Perfect Binary Tree 2.1 Introduction to Binary Tree A binary tree is a special kind of tree that can have at-most 2 children. 2.2 […]
Tree data structure tutorial 1. Tree Data Structure Introduction
In this chapter you are going to learn about below topics: 1.1 What is a tree data structure? 1.2 Types of trees 1.3 Types of tree traversal 1.4 What is a tree? 1.5 How a tree is represented? 1.6 Full tree representation. 1.7 Different Terminology involved in Trees. 1.8 Applications of Tree. 1.9 Properties of […]
Data structure tutorial 10: Implementation of Circular Queue using Linked List
In this chapter we shall learn about below topics: 10.1 Introduction to Circular Queue Data Structure 10.2 Implementation of Circular Queue 10.3 Implementation of Circular Queue using Linked List 10.4 Output 10.1 Introduction to Circular Queue Data Structure In the previous chapter we have seen the implementation of Circular Queue using arrays. In this chapter […]
Data structure tutorial 9: Circular Queues Data structure introduction and Implementation using arrays.
In this chapter we shall learn about below topics: 9.1 Introduction to Circular Queue Data Structure 9.2 Formula to calculate to insert elements 9.3 Understanding inserting elements with an example 9.4 Implementation of Circular Queue using arrays 9.1. Introduction to Circular Queue Data Structure In the previous chapter we have seen the implementation of simple […]
Data structure tutorial 8: Queue Data Structure implementation using linked list in C
In this chapter we shall learn about below topics: 8.1 Introduction to Queue Data Structure 8.2 Operations performed on Queue 8.3 Implementation of Queue using Linked List 8.4 Output of the program 8.1. Introduction to Queue Data Structure In previous chapter we have seen how to implement queue using arrays. In this chapter we shall […]
Data structure tutorial 7: Introduction to Queue Data Structure
In this chapter we shall learn about below topics: 7.1 Introduction to Queue Data Structure 7.2 Pictorial Representation of Queue 7.3 Disadvantages of Queue Data Structure 7.4 Operations performed on Queue Data Structure 7.5 Implementation of Queue Data Structure 7.6 Output of the program 7.1 What is a Queue? A queue is a data structure […]
Data structure tutorial 6: Circular Doubly Linked List
In this chapter we shall learn about below topics: 6.1 Representation of Circular Double Linked List 6.2 Operations performed on Double Linked List 6.3 Implementation of Circular Doubly Linked List 6.4 Output of the program In the previous chapter we saw how to create a Doubly Linked List. In this chapter we shall learn about […]
Data structure tutorial 5: Circular Singly Linked List
In this chapter we shall learn about below topics: 5.1 Introduction to Circular Single Linked List 5.2 Representation of Circular Single Linked List 5.3 Operations performed on Circular Single Linked List 5.4 Implementation of Circular Single Linked List 5.5 Output of the program 5.1. Introduction to Circular Single Linked List In the first chapter of […]
Data structure tutorial 4: Doubly Linked List [DLL]
In this chapter we shall learn about below topics: 4.1 Introduction to Double Linked List 4.2 Representation of Double Linked List 4.3 Operations performed on Double Linked List 4.4 Implementation of Single Linked List 4.5 Output of the program In the previous chapter we learnt about single linked list. In this chapter we shall learn […]