diff -r 8b7c98b7acaac42034eff0ebee63d7b143841e26 -r aae1d6bbd33b56fe4ba8c784a9c68ea1fdc1ff64 cpp/algorithms/algorithms.vcxproj
--- a/cpp/algorithms/algorithms.vcxproj	Sun Feb 17 18:50:14 2013 -0600
+++ b/cpp/algorithms/algorithms.vcxproj	Tue Feb 19 23:47:40 2013 -0600
@@ -20,9 +20,11 @@
     <ClInclude Include="src\InsertSort.h" />
     <ClInclude Include="src\MedianSort.h" />
     <ClInclude Include="src\MergeSort.h" />
+    <ClInclude Include="src\Node.h" />
     <ClInclude Include="src\QuickSort.h" />
     <ClInclude Include="src\SearchAlgorithm.h" />
     <ClInclude Include="src\SortAlgorithm.h" />
+    <ClInclude Include="src\Tree.h" />
     <ClInclude Include="src\vector_helper.h" />
   </ItemGroup>
   <PropertyGroup Label="Globals">
diff -r 8b7c98b7acaac42034eff0ebee63d7b143841e26 -r aae1d6bbd33b56fe4ba8c784a9c68ea1fdc1ff64 cpp/algorithms/algorithms.vcxproj.filters
--- a/cpp/algorithms/algorithms.vcxproj.filters	Sun Feb 17 18:50:14 2013 -0600
+++ b/cpp/algorithms/algorithms.vcxproj.filters	Tue Feb 19 23:47:40 2013 -0600
@@ -50,5 +50,11 @@
     <ClInclude Include="src\BinarySearch.h">
       <Filter>Header Files</Filter>
     </ClInclude>
+    <ClInclude Include="src\Node.h">
+      <Filter>Header Files</Filter>
+    </ClInclude>
+    <ClInclude Include="src\Tree.h">
+      <Filter>Header Files</Filter>
+    </ClInclude>
   </ItemGroup>
 </Project>
\ No newline at end of file
diff -r 8b7c98b7acaac42034eff0ebee63d7b143841e26 -r aae1d6bbd33b56fe4ba8c784a9c68ea1fdc1ff64 cpp/algorithms/src/Node.h
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/cpp/algorithms/src/Node.h	Tue Feb 19 23:47:40 2013 -0600
@@ -0,0 +1,54 @@
+#ifndef NODE_H
+#define NODE_H
+
+#define null 0
+
+#include <string>
+#include <iostream>
+
+template <class T>
+class Node
+{
+private:
+	Node * createNode(T obj)
+	{
+		Node<T> * newnode = new Node<T>(obj);
+		newnode->parent = this;
+		return newnode;
+	}
+
+	void initVars()
+	{
+		this->parent = 0;
+		this->left = 0;
+		this->right = 0;
+	}
+public:
+	Node(T obj) { this->object = obj; initVars(); }
+	T object;
+	Node * parent;
+	Node * left;
+	Node * right;
+
+	Node<T> * addLeft(T obj)
+	{
+		if (this->left != null)
+			throw std::string("Left is not null!");
+		this->left = createNode(obj);
+	}
+
+	Node<T> * addRight(T obj)
+	{
+		if (this->right != null)
+			throw std::string("Right is not null!");
+		this->right = createNode(obj);
+	}
+
+	void addLeftRight(T left, T right)
+	{
+		this->addLeft(left);
+		this->addRight(right);
+	}
+};
+
+#endif
\ No newline at end of file
diff -r 8b7c98b7acaac42034eff0ebee63d7b143841e26 -r aae1d6bbd33b56fe4ba8c784a9c68ea1fdc1ff64 cpp/algorithms/src/Tree.h
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/cpp/algorithms/src/Tree.h	Tue Feb 19 23:47:40 2013 -0600
@@ -0,0 +1,97 @@
+#ifndef TREE_H
+#define TREE_H
+
+#include "Node.h"
+#include <vector>
+
+template <class T>
+class Tree
+{
+private:
+	void _DeleteTree(Node<T> * node)
+	{
+		cout << "Killing node: " << node->object << endl;
+		if (node->left != null)
+			_DeleteTree(node->left);
+		if (node->right != null)
+			_DeleteTree(node->right);
+		delete node;
+		node = null;
+	}
+public:
+	Node<T> * root;
+
+	void DeleteTree()
+	{
+		this->_DeleteTree(root);
+	}
+	Tree(Node<T> * root)
+	{
+		this->root = root;
+	}
+	~Tree()
+	{
+		//DeleteTree(root);
+	}
+
+	std::vector<Node<T> *> getBoundary()
+	{
+		std::vector<Node<T> *> edges;
+		edges.push_back(root);
+		std::vector<Node<T> *> tmp;
+		tmp = getLeftEdges(root->left);
+		edges.insert(edges.end(), tmp.begin(), tmp.end());
+		tmp = getRightEdges(root->right);
+		edges.insert(edges.end(), tmp.begin(), tmp.end());
+		return edges;
+	}
+
+	std::vector<Node<T> *> getLeftEdges(Node<T> * nodes)
+	{
+		std::vector<Node<T> *> ret;
+		if (nodes == null)
+			return ret;
+		if (nodes->parent->right == nodes) //if the node is a right child
+		{
+			//add current node
+			if (nodes->right == null && nodes->left == null)
+				ret.push_back(nodes);
+		} 
+		else if (nodes->parent->left == nodes) // if the node is a left child
+		{
+			ret.push_back(nodes);
+		}
+		std::vector<Node<T> *> tmp;
+		tmp = getLeftEdges(nodes->left);
+		ret.insert(ret.end(), tmp.begin(), tmp.end());
+		tmp = getLeftEdges(nodes->right);
+		ret.insert(ret.end(), tmp.begin(), tmp.end());
+		return ret;
+	}
+
+	std::vector<Node<T> *> getRightEdges(Node<T> * nodes)
+	{
+		std::vector<Node<T> *> ret;
+		if (nodes == null)
+			return ret;
+		
+		std::vector<Node<T> *> tmp;
+		tmp = getRightEdges(nodes->left);
+		ret.insert(ret.end(), tmp.begin(), tmp.end());
+		tmp = getRightEdges(nodes->right);
+		ret.insert(ret.end(), tmp.begin(), tmp.end());
+		if (nodes->parent->right == nodes) //if the node is a right child
+		{
+			//add current node
+			ret.push_back(nodes);
+		} 
+		else if (nodes->parent->left == nodes) // if the node is a left child
+		{
+			if (nodes->right == null && nodes->left == null)
+				ret.push_back(nodes);
+		}
+		return ret;
+	}
+};
+
+#endif
\ No newline at end of file
diff -r 8b7c98b7acaac42034eff0ebee63d7b143841e26 -r aae1d6bbd33b56fe4ba8c784a9c68ea1fdc1ff64 cpp/algorithms/src/main.cpp
--- a/cpp/algorithms/src/main.cpp	Sun Feb 17 18:50:14 2013 -0600
+++ b/cpp/algorithms/src/main.cpp	Tue Feb 19 23:47:40 2013 -0600
@@ -9,19 +9,43 @@
 #include "QuickSort.h"
 #include "MergeSort.h"
 #include "BinarySearch.h"
+#include "Node.h"
+#include "Tree.h"
 
 using namespace std;
 
 int main()
 {
-	MergeSort<int> sort1;
-	//sort1.initContainer(create_vector<string>("test")("test2"));
+	/*//sort1.initContainer(create_vector<string>("test")("test2"));
 	//cout << sort1.ToString();
 	//vector<int> arr1 = create_vector<int>(
+	MedianSort<int> sort1;
 	sort1.initContainer(create_vector<int>(3)(2)(4)(3)(1));
 	sort1.Sort();
 	cout << sort1.ToString() << endl;
-	BinarySearch<int> search1;
-	search1.initContainer(sort1.getContainer());
-	cout << search1.Search(7) << endl;
+	//BinarySearch<int> search1;
+	//search1.initContainer(sort1.getContainer());
+	//cout << search1.Search(7) << endl;*/
+	Node<int> * root = new Node<int>(30);
+	Node<int> * l = root->addLeft(20);
+	Node<int> * r = root->addRight(40);
+	l->addLeft(10)->addLeftRight(5,15);
+	l->addRight(25)->addRight(28);
+	r->addLeft(35);
+	r->addRight(50)->addRight(41);
+	Tree<int> tree(root);
+	vector<Node<int> *> nodes = tree.getBoundary(); 
+	for(size_t i = 0; i < nodes.size(); i++)
+	{
+		cout << nodes[i]->object << " ";
+	}
+	cout << endl;
+	tree.DeleteTree();
+	//root->addRight(
+	//root->left
+	//Tree<int> t(root);
+	
+
+
+	//delete root;
 }	
\ No newline at end of file