Tree Traversal: visiting every node of a tree. Unlike other linear data structures, where we traverse through every element in order, it’s not the same with the tree. Trees being non-linear data structures, there will always be more than one way to traverse through a tree. There are three types… Read More »Tree Traversals – Preorder, Inorder, Postorder
Linked List is one of the most important data structures and understanding how it works is easier than you think, this post explains the Linked List code in C++. Important Operations on a Linked List As you can see below we use a separate class for Linked List this helps… Read More »Linked List Code in C++
The Queue is one of the most important Linear Data Structure, Queue program follows the FIFO rule i.e First In First Out. The contents in a queue exit in the same order they have entered, if an element is to be removed from the queue then the first element that… Read More »Queue program in C++ using Array and STL
I was brushing up my data structure skills and this post contains code for the Stack program using both Array and STL containers, the Stack follows the LIFO mechanism i.e Last In First Out, the element that was inserted last will also be the first to be deleted like a… Read More »Stack Program in C++ using Array and STL