Tree :Binary Tree is a special data structure used for data storage purposes. A binary tree has a special condition that each node can have a maximum of two children.
Dynamic Stack : Stack is a linear data structure in which insertion and deletion of elements takes place only one end known as TOP.
Circular Linked List :Circular Linked List is a variation of Linked list in which the first element points to the last element and the last element points to the first element. Both Singly Linked List and Doubly Linked List can be made into a circular linked list.
Sorting :Sorting refers to arranging data in a particular format. Sorting algorithm specifies the way to arrange data in a particular order. Most common orders are in numerical or lexicographical order.Bubble Sort is a simple algorithm which is used to sort a given set of n elements provided in form of an array with n number of elements. Bubble Sort compares all the element one by one and sort them based on their values.
Data Structures & Algorithm Basic Concepts : Data structure introduction refers to a scheme for organizing data, or in other words a data structure is an arrangement of data in computer’s memory in such a way that it could make the data quickly available to the processor for required calculations.
Linked List : A linked list is a sequence of data structures, which are connected together via links.Linked List is a sequence of links which contains items. Each link contains a connection to another link. Linked list is the second most-used data structure after array.
Simple Stack :Stack is an ordered list of similar data type. Stack is a LIFO structure. (Last in First out). push() function is used to insert new elements into the Stack and pop() is used to delete an element from the stack. Both insertion and deletion are allowed at only one end of Stack called Top.
Simple List in Data Structures : Insertion into a singly-linked list has two special cases. It’s insertion a new node before the head (to the very beginning of the list) and after the tail (to the very end of the list). In any other case, new node is inserted in the middle of the list and so, has a predecessor and successor in the list.
Enqueue function in Dynamic Queue :Queue Data Structure, we can insert elements until queue becomes full. But once if queue becomes full, we can not insert the next element until all the elements are deleted from the queue.
Data Structure: Implementation of Queue in C++ :Hi,Hope you Are Fine.Today we make program of Queue it is an abstract data structure, somewhat similar to Stacks. Unlike stacks, a queue is open at both its ends.