1. Write a program to add sum of all left most leaf node in a tree. In this example you have to add the nodes 2,5 & 4 Answer : enum direction{ left=1, right }; int calculateleftmost(struct tree* root, direction d) { int ls=0, rs =0; if(root->left == NULL && root->right == NULL) { if(d == left) { return root->data; } } if(root == NULL) return 0; ls = calculateleftmost(tree->left, left); lr = calculateleftmost(tree->right, right) return ls+rs; } 2. How to get the Kth largest number in an unsorted array Answer: soluton 1: 2...