Dynamic Programming concept
The basic idea of DP is applicable to problems that can be thought in terms of recursion. For example, consider problem of computing n’th fibonacci term:
Count all left nodes in a Binary tree
One way to ask this question is: Given a Binary tree that represent a family hierarchy. A parent can have at most two children (at most one girl child and at most one boy child). A girl child (if present) is always represented as left child in the binary tree, and a boy child (if present) […]
Check if a Binary Tree is Complete Binary Tree – Video
This is video discussion of a typical interview problem to check if the given Binary tree is a complete Binary tree or not.
