add binary tree codes

Author: msdeep14

a.out

@@ -0,0 +1,68 @@
+// http://www.geeksforgeeks.org/check-two-nodes-cousins-binary-tree/
+#include <bits/stdc++.h>
+using namespace std;
+
+// struct node of binary tree
+struct node{
+	int data;
+	node *left, *right;
+};
+
+// return new node 
+node *getnode(int data){
+	node *temp = new node();
+	temp->data = data;
+	temp->left = temp->right = NULL;
+}
+
+int checkIfSibling(node *root, int p1, int p2){
+	if(!root) return 0;
+	if(root->left && root->right){
+		if((root->left->data == p1 && root->right->data == p2) ||
+			(root->left->data == p2 && root->right->data == p1)) return 1;
+	}
+	return (checkIfSibling(root->left,p1,p2) || checkIfSibling(root->right,p1,p2));
+}
+
+int checkCousin(node *root, int p1, int p2){
+	int a = -1, b = -1;
+	queue<node*> q;
+	if(!root) return 0;
+	q.push(root);
+	while(!q.empty()){
+		int size = q.size();
+		a = -1, b = -1;
+		while(size--){
+			node *temp = q.front();
+			q.pop();
+			if(temp->data == p1)
+				a = 1;
+			else if(temp->data == p2)
+				b = 1;
+			if(temp->left) q.push(temp->left);
+			if(temp->right) q.push(temp->right); 
+		}
+		if(a == 1 && b == 1 && !checkIfSibling(root,p1,p2))
+			return 1;
+	}
+	return 0;
+}
+
+int main(){
+	//contruct binary tree
+	node *root = getnode(1);
+	root->left = getnode(2);
+	root->left->left = getnode(4);
+	root->left->right = getnode(5);
+	root->left->left->right = getnode(2);
+	root->right = getnode(3);
+	root->right->right = getnode(8);
+	root->right->right->left = getnode(6);
+	root->right->right->right = getnode(7);
+
+	int p1 = 4, p2 = 8;
+	if(checkCousin(root,p1,p2)) cout << "yes\n";
+	else cout << "No\n";
+	
+	return 0;
+}

check-two-nodes-cousins-binary-tree.cpp

@@ -0,0 +1,12 @@
+// http://practice.geeksforgeeks.org/problems/egg-dropping-puzzle/0
+#include <bits/stdc++.h>
+using namespace std;
+int main(){
+	int t,n,k;
+	cin>>t;
+	while(t--){
+		cin>>n>>k;
+
+	}
+	return 0;
+}

egg-dropping-puzzle

@@ -0,0 +1,55 @@
+// http://www.geeksforgeeks.org/find-sum-left-leaves-given-binary-tree/
+
+// CPP program to find total sum
+// of right leaf nodes
+#include <bits/stdc++.h>
+using namespace std;
+
+// struct node of binary tree
+struct node{
+	int data;
+	node *left, *right;
+};
+
+// return new node 
+node *getnode(int data){
+	node *temp = new node();
+	temp->data = data;
+	temp->left = temp->right = NULL;
+}
+
+// utility function to calculate sum 
+// of right leaf nodes
+void rightLeafSum(node *root, int *sum){
+	if(!root) 
+		return;
+
+	// check if the right child of root 
+	// is leaf node
+	if(root->right)
+		if(!root->right->left  &&  !root->right->right)
+			*sum += root->right->data;
+
+	rightLeafSum(root->left, sum);
+	rightLeafSum(root->right, sum);
+}
+
+// driver program
+int main(){
+	//contruct binary tree
+	node *root = getnode(1);
+	root->left = getnode(2);
+	root->left->left = getnode(4);
+	root->left->right = getnode(5);
+	root->left->left->right = getnode(2);
+	root->right = getnode(3);
+	root->right->right = getnode(8);
+	root->right->right->left = getnode(6);
+	root->right->right->right = getnode(7);
+
+	// variable to store sum of right leaves
+	int sum = 0;
+	rightLeafSum(root, &sum);
+	cout << sum << endl;
+	return 0;
+}

egg-dropping-puzzle.cpp

@@ -0,0 +1,46 @@
+/*
+Given two strings return the value of least number of manipulations needed to ensure both strings have identical characters.
+ For input aab aba it’s 0, for input abc cdd it is 2
+
+
+*/
+
+// CPP program to count least number
+// of manipulations to have two strings
+// set of same characters
+#include <bits/stdc++.h>
+using namespace std;
+
+// return the count of manipulations
+// required
+int leastCount(string s1, string s2, int n){
+	int count1[26] = {0};
+	int count2[26] = {0};
+
+	// count the number of different 
+	// characters in both strings
+	for(int i = 0; i < n; i++){
+		count1[s1[i] - 'a'] += 1;
+		count2[s2[i] - 'a'] += 1;
+	}
+
+	// check the difference of character
+	// by comparing count arrays
+	int res = 0;
+	for(int i = 0; i < 26; i++){
+		if(count1[i] != 0){
+			res += abs(count1[i] - count2[i]);
+		}
+	}
+	return res;
+}
+
+// driver program
+int main(){
+	string s1 = "cdd";
+	string s2 = "abc";
+	int len = s1.length();
+	int res = leastCount(s1,s2,len);
+	cout << res << endl;
+	return 0;
+}