diff --git a/DecisionTree/.project b/DecisionTree/.project
new file mode 100644
index 0000000..0be3128
--- /dev/null
+++ b/DecisionTree/.project
@@ -0,0 +1,17 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<projectDescription>
+	<name>DecisionTree</name>
+	<comment></comment>
+	<projects>
+	</projects>
+	<buildSpec>
+		<buildCommand>
+			<name>org.python.pydev.PyDevBuilder</name>
+			<arguments>
+			</arguments>
+		</buildCommand>
+	</buildSpec>
+	<natures>
+		<nature>org.python.pydev.pythonNature</nature>
+	</natures>
+</projectDescription>
diff --git a/DecisionTree/.pydevproject b/DecisionTree/.pydevproject
new file mode 100644
index 0000000..5aa3e28
--- /dev/null
+++ b/DecisionTree/.pydevproject
@@ -0,0 +1,10 @@
+<?xml version="1.0" encoding="UTF-8" standalone="no"?>
+<?eclipse-pydev version="1.0"?>
+
+<pydev_project>
+<pydev_property name="org.python.pydev.PYTHON_PROJECT_INTERPRETER">Default</pydev_property>
+<pydev_property name="org.python.pydev.PYTHON_PROJECT_VERSION">python 2.7</pydev_property>
+<pydev_pathproperty name="org.python.pydev.PROJECT_SOURCE_PATH">
+<path>/DecisionTree</path>
+</pydev_pathproperty>
+</pydev_project>
diff --git a/DecisionTree/src/dt.py b/DecisionTree/src/dt.py
new file mode 100644
index 0000000..16ba14f
--- /dev/null
+++ b/DecisionTree/src/dt.py
@@ -0,0 +1,118 @@
+import math
+import operator
+
+
+def calcShannonEnt(dataSet):
+    numEntries=len(dataSet)
+    
+    labelCounts={}
+
+    for featVec in dataSet:
+        currentLabel=featVec[-1]
+       
+        if currentLabel not in labelCounts.keys():
+            labelCounts[currentLabel]=0        
+        labelCounts[currentLabel]+=1
+    shannonEnt=0.0
+    
+    for key in labelCounts:
+         
+         prob =float(labelCounts[key])/numEntries        
+         shannonEnt-=prob*math.log(prob,2)
+
+    return shannonEnt           
+    
+
+def createDataSet():
+    
+    dataSet=[[1,0,'man'],[1,1,'man'],[0,1,'man'],[0,0,'women']]
+    labels=['throat','mustache']
+    return dataSet,labels
+
+def splitDataSet(dataSet, axis, value):
+    retDataSet = []
+    for featVec in dataSet:
+        if featVec[axis] == value:
+            reducedFeatVec = featVec[:axis]     #chop out axis used for splitting            
+            reducedFeatVec.extend(featVec[axis+1:])      
+            retDataSet.append(reducedFeatVec)          
+    return retDataSet
+
+def chooseBestFeatureToSplit(dataSet):
+    numFeatures = len(dataSet[0]) - 1      #the last column is used for the labels
+    baseEntropy = calcShannonEnt(dataSet)
+    bestInfoGain = 0.0; bestFeature = -1
+    for i in range(numFeatures):        #iterate over all the features
+        featList = [example[i] for example in dataSet]#create a list of all the examples of this feature
+       
+        uniqueVals = set(featList)       #get a set of unique values
+        
+        newEntropy = 0.0
+        for value in uniqueVals:
+            subDataSet = splitDataSet(dataSet, i, value)
+            prob = len(subDataSet)/float(len(dataSet))
+            newEntropy += prob * calcShannonEnt(subDataSet)     
+        infoGain = baseEntropy - newEntropy     #calculate the info gain; ie reduction in entropy
+        
+        if (infoGain > bestInfoGain):       #compare this to the best gain so far
+            bestInfoGain = infoGain         #if better than current best, set to best
+            bestFeature = i
+    return bestFeature                      #returns an integer
+
+     
+
+
+    
+def majorityCnt(classList):
+    classCount={}
+    for vote in classList:
+        if vote not in classCount.keys(): classCount[vote] = 0
+        classCount[vote] += 1
+    sortedClassCount = sorted(classCount.iteritems(), key=operator.itemgetter(1), reverse=True)
+    return sortedClassCount[0][0]
+
+def createTree(dataSet,labels):
+    classList = [example[-1] for example in dataSet]
+    
+    if classList.count(classList[0]) == len(classList): 
+        return classList[0]#stop splitting when all of the classes are equal
+    if len(dataSet[0]) == 1: #stop splitting when there are no more features in dataSet
+        return majorityCnt(classList)
+    bestFeat = chooseBestFeatureToSplit(dataSet)
+    bestFeatLabel = labels[bestFeat]   
+    myTree = {bestFeatLabel:{}}
+    del(labels[bestFeat])
+    featValues = [example[bestFeat] for example in dataSet]
+    uniqueVals = set(featValues)
+    for value in uniqueVals:       
+        subLabels = labels[:]       #copy all of labels, so trees don't mess up existing labels
+       
+        myTree[bestFeatLabel][value] = createTree(splitDataSet(dataSet, bestFeat, value),subLabels)
+        
+    return myTree
+
+def classify(inputTree,featLabels,testVec):
+    firstStr = inputTree.keys()[0]
+    secondDict = inputTree[firstStr]
+    featIndex = featLabels.index(firstStr)
+    key = testVec[featIndex]
+    valueOfFeat = secondDict[key]
+    if isinstance(valueOfFeat, dict): 
+        classLabel = classify(valueOfFeat, featLabels, testVec)
+    else: classLabel = valueOfFeat
+    return classLabel
+
+def getResult():
+    dataSet,labels=createDataSet()
+   #  splitDataSet(dataSet,1,1)
+    chooseBestFeatureToSplit(dataSet)
+   # print  chooseBestFeatureToSplit(dataSet)
+    #print calcShannonEnt(dataSet)
+    mtree=createTree(dataSet,labels)
+    print mtree
+
+    print classify(mtree,['throat','mustache'],[0,0])
+     
+if __name__=='__main__':   
+    getResult()    
+