Data structures and algorithms are the most important topic in computer science . this is used to store data efficiently and can be managed easily. Data structures have topics like Stacks, Queues, Linked lists, Trees and so many important concepts, these are explained with code snippets and video tutorials

To inorder a non-empty binary tree, below operations are preformed recursively of each node traversing the left subtree visiting root node traversing the right subtree the word “in” specifies that the root node is accessed in the middle of both…

To postorder a non-empty binary tree, below operations are preformed recursively of each node traversing the left subtree traversing the right subtree visiting the root node the word “post” specifies that the root node is accessed last to any other…

The search function is used to find whether the key element(value to find) is present in the binary tree or not the search always begins with the root node, key-value is compared with the root node if the value is…

Adding a new node in the binary tree should not violate the properties of the binary tree the root value is checked with the root node case 1: If the new node value is less than the root value traversing…

to delete a particular node in a binary search tree there are three cases case1: deleting a node that has no children case2: deleting a node that has only one child case3: deleting a node that has only two child…

a binary tree is a type of tree data structure, which doesn’t have more than two child nodes for one parent node. a binary tree contains a finite set of nodes above tree has a three child nodes E,F,G to…

queue is one type of linear data structure,it follows (FIFO) first in first out. the elements which are inserted first, that element will be removed first create queue using linked list the advantage of stacks using linked list is, there…

queue is one type of linear data structure,it follows (FIFO) first in first out. the elements which are inserted first, that element will be removed first create queue using array define a MAX variable for maximum size of the queue…

queue is one type of linear data structure, it follows (FIFO) first in first out. the elements which are inserted first, that element will be removed first let’s look into a real-time example in the below image, some persons are…

stack is a type of data structure.this is LIFO (Last In First Out) type of data stures.in the stack, elements can be added or removed only from one end the advantage of stacks using linked list is , there is size limit…