Intermediate part 5

[vishnumani2009]

Check whether a binary tree is a full binary tree or not
Find sum of all left leaves in a given Binary Tree
Remove nodes on root to leaf paths of length < K
Find Count of Single Valued Subtrees
Check if a given array can represent Preorder Traversal of Binary Search Tree
Mirror of n-ary Tree
Find multiplication of sums of data of leaves at same levels
Succinct Encoding of Binary Tree
Construct Binary Tree from given Parent Array representation
Symmetric Tree (Mirror Image of itself)
Find Minimum Depth of a Binary Tree