Tree Traversals video tutorial

A Binary Tree can be traversed in different ways. Following are the generally used ways for traversing trees. (a)  Inorder (b)  Preorder (c)  Postorder Check the awesome explanation of tree traversal by Tushar Roy To check out simple text based explanation click here  

Read More

0/1 Knapsack Problem Dynamic Programming

Given weights and values of n items, put these items in a knapsack of capacity W to get the maximum total value in the knapsack. In other words, given two integer arrays val[0..n-1] and wt[0..n-1] which represent values and weights associated with n items respectively. Also given an integer W which represents knapsack capacity, find out the maximum...

Read More

FOLLOW US ON LinkedIn



Explore Tutu'rself