Implement a Binary tree with inOrder postOrder preOrder
A binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child. In this …
Read MoreTag: algorithm
Greedy Algorithm & Fractional Knapsack Problem With Example
Greedy Algorithm Today you are going to read our complete Greedy Algorithm & Fractional Knapsack Problem With Example. Before discussing the Fractional Knapsack, we talk a bit about the Greedy Algorithm. …
Read More
How to implement Stack using Link List?
Hello Programmer, Are you afraid for link list ? In this tutorial I’ll show how to implement Stack using link list. A linked list is a linear collection of data elements whose order is not given …
Read More
What is queue in data structure?
A Queue is a linear structure which follows a particular order in which the operations are performed. The order is First In First Out (FIFO). A good example of a …
Read More
What is Stack in Data Structure?
Stack is a linear data structure which follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out), for example – a deck …
Read More