DDE-1/Classification.md

@@ -81,11 +81,16 @@ v.Return the Tree
 ```
 
 The recursive algorithm is stopped when either of the followings is true:
-•	All examples in the training set belong to a single class / value y,
-•	The maximum tree depth is reached,
-•	 If the node is further split, the number of cases in one or more child nodes will be less than the minimum number instances in a node,
-•	The number of examples left in the node is less than the minimum number set for parent nodes,
-•	Splitting leads to a split score less than a threshold value.
+
+* All examples in the training set belong to a single class / value y,
+
+* The maximum tree depth is reached,
+
+* If the node is further split, the number of cases in one or more child nodes will be less than the minimum number instances in a node,
+
+* The number of examples left in the node is less than the minimum number set for parent nodes,
+
+* Splitting leads to a split score less than a threshold value.
 
 ### CART