Added circumference of tree program

sinagarajan · sinagarajan · commit 6f327e68a5b5 · 2013-02-17T11:01:16.000+05:30
diff --git a/BinaryTreeAlgorithms/READ_ME.txt b/BinaryTreeAlgorithms/READ_ME.txt
@@ -0,0 +1,5 @@
+# Command to create Binary
+
+make -f Makefile 
+
+# Output file binarytree
diff --git a/BinaryTreeAlgorithms/binarytree.cpp b/BinaryTreeAlgorithms/binarytree.cpp
@@ -432,3 +432,47 @@ struct tree* findLargestBSTSubtree(struct tree *root) {
   findLargestBSTSubtree(root, min, max, maxNodes, largestBST);
   return largestBST;
 }
+
+
+void findCircumference(struct tree *root)
+{
+	int currLevel = 0, nextLevel =0 , count = 0;
+	struct tree *itr;
+	stack<struct tree *> s1;
+	stack<struct tree *> s2;
+	stack<struct tree *> temp;
+	if(root == NULL)
+		return ;
+	s1.push(root);
+	++currLevel;
+	while(!s1.empty())
+	{
+		itr= s1.top();
+		s1.pop();
+		if(itr->left !=NULL)
+		{
+			s2.push(itr->left);
+			++nextLevel;
+		}
+		if(itr->right != NULL)
+		{
+			s2.push(itr->right);
+			++nextLevel;
+		}
+		if((itr->left == NULL && itr->right == NULL) && (count != 0) && (count != currLevel))
+			printf("\t%d", itr->data);
+		if(count == 0 || count == currLevel-1)
+			printf("\t%d", itr->data);
+		++count;
+		if(s1.empty())
+		{
+			s1 = s2;
+			s2 = temp;
+			count=0;
+			currLevel = nextLevel;
+			nextLevel = 0;
+		}
+
+	}
+
+}
diff --git a/BinaryTreeAlgorithms/binarytree.h b/BinaryTreeAlgorithms/binarytree.h
@@ -31,6 +31,7 @@ void printPreorderRecursive(struct tree *root);
 
 void printPostorderRecursive(struct tree *root);
 
+void findCircumference(struct tree *root);
 
 void printLevelorder(struct tree *root);
 
diff --git a/BinaryTreeAlgorithms/btappln.cpp b/BinaryTreeAlgorithms/btappln.cpp
@@ -27,6 +27,7 @@ while(1)
                                 "\n17 Find Diamter of the tree"<<
                                 "\n18 Convert sorted array to BST"<<
                                 "\n19 Find Max BST"<<
+				"\n20 Find Nodes in Circumference"<<
                                 "\n50 Exit\n";
         scanf("%d",&i);
         switch (i)
@@ -48,6 +49,8 @@ while(1)
                         printLevelorder(root);
                         break;
                 case 6:
+			printf("\nEnter the value \n");scanf("%d",&input);
+			insertNodeBT(root,input);	
                         break;
                 case 7:
                         input=countNode(root);
@@ -109,6 +112,9 @@ while(1)
 //                        printLevelorder(itr);
 			cout<<"not implemented yet\n";
                         break;
+		case 20:
+			findCircumference(root);
+			break;
                 case 50:
                         exit(1);
                 default:

Original file line number	Diff line number	Diff line change
`@@ -31,6 +31,7 @@ void printPreorderRecursive(struct tree *root);`
`31`	`31`
`32`	`32`	`void printPostorderRecursive(struct tree *root);`
`33`	`33`
	`34`	`+void findCircumference(struct tree *root);`
`34`	`35`
`35`	`36`	`void printLevelorder(struct tree *root);`
`36`	`37`