Corrected Documentation Typos

Raven G. Duran · Raven G. Duran · commit 697f219bc2fb · 2012-09-16T21:42:56.000+08:00
diff --git a/documentation.md b/documentation.md
@@ -32,12 +32,12 @@ struct node* insertN(struct node *root,int value,struct node *parent);
 
 The two functions are the core in creating a BST like structure.
 * newNode function 	: This function creates a basic node. Paremeters:
-	** value		: The value you want to put to the node.
-	** parent		: The parent of the Node (Can also be NULL).
+	1. value		: The value you want to put to the node.
+	2. parent		: The parent of the Node (Can also be NULL).
 * insertN function	: This inserts a new node properly into the tree. Parameters:
-	** root			: Pointer to the root of the tree of where to insert the new node.
-	** value		: The value you want to insert.
-	** parent		: The parent of the new node you are inserting. (A bit redundant, but this helps a lot in tracking trees)
+	1. root			: Pointer to the root of the tree of where to insert the new node.
+	2. value		: The value you want to insert.
+	3. parent		: The parent of the new node you are inserting. (A bit redundant, but this helps a lot in tracking trees)
 	
 If you want a more thorough explanation of the BST functions,
 then you can go to this link: [Binary Search Tree Operations Explanation (Bisaya)](http://pastebin.com/DCkF4JAn)
