diff --git a/chapters/computational_physics/verlet.md b/chapters/computational_physics/verlet.md
index ba18de7f1..314e102f7 100644
--- a/chapters/computational_physics/verlet.md
+++ b/chapters/computational_physics/verlet.md
@@ -435,7 +435,7 @@ Submitted by P. Mekhail
 
 #### C
 
-```
+```c
 // Submitted by Gathros
 #include <stdio.h>
 
@@ -502,3 +502,69 @@ int main(){
 
 }
 ```
+
+### JavaScript
+
+```html
+<!DOCTYPE html>
+<html>
+<body>
+<script>
+function verlet(pos, acc, dt){
+
+    var prev_pos, temp_pos, time;
+    prev_pos = pos;
+    time = 0;
+
+    while (pos > 0){
+        time += dt;
+        temp_pos = pos;
+        pos = pos*2 - prev_pos + acc * dt * dt;
+        prev_pos = temp_pos;
+    }
+
+   return time;
+
+}
+
+function stormer_verlet(pos, acc, dt){
+
+    var prev_pos, temp_pos, time, vel;
+    prev_pos = pos;
+    vel = 0;
+    time = 0;
+    while (pos > 0){
+        time += dt;
+        temp_pos = pos;
+        pos = pos*2 - prev_pos + acc * dt * dt;
+        prev_pos = temp_pos;
+
+        vel += acc*dt;
+    }
+
+   return time;
+
+}
+
+function velocity_verlet(pos, acc, dt){
+
+    var time, vel;
+    vel = 0;
+    time = 0;
+    while (pos > 0){
+        time += dt;
+        pos += vel*dt + 0.5*acc * dt * dt;
+        vel += acc*dt;
+    }
+
+   return time;
+
+}
+
+document.write(verlet(5.0, -10, 0.01) + "<br>");
+document.write(stormer_verlet(5.0, -10, 0.01) + "<br>");
+document.write(velocity_verlet(5.0, -10, 0.01) + "<br>");
+</script>
+</body>
+</html>
+```
diff --git a/chapters/fundamental_algorithms/tree_traversal.md b/chapters/fundamental_algorithms/tree_traversal.md
index 4026a04a0..afd3d36fd 100644
--- a/chapters/fundamental_algorithms/tree_traversal.md
+++ b/chapters/fundamental_algorithms/tree_traversal.md
@@ -330,7 +330,7 @@ main()
 
 ### C
 
-```C:
+```c
 // Submitted by Gathros
 #include <stdio.h>
 #include <stdlib.h>
@@ -597,3 +597,78 @@ namespace Tree_Traversal
     }
 }
 ```
+
+#### JavaScript
+
+```html
+<!DOCTYPE html>
+<html>
+<body>
+<script>
+function create_tree(n, num_row, num_child){
+	n.ID = num_row;
+    n.children = [];
+	if(num_row == 0){
+		return;
+	}
+
+	for(var i = 0; i < num_child; ++i){
+		var child = new Object();
+		create_tree(child, num_row - 1, num_child);
+		n.children.push(child);
+	}
+};
+
+function DFS_recursive(n){
+	document.write(n.ID + "<br>");
+    if(n.children.length == 0){
+    	return;
+    }
+	for(var i = 0; i < n.children.length; ++i){
+		DFS_recursive(n.children[i]);
+	}
+}
+
+function DFS_stack(n){
+	var s = [];
+    s.push(n);
+    var temp;
+    
+    while(s.length > 0){
+    	temp = s.pop();
+    	document.write(temp.ID + "<br>");
+        for(var i = 0; i < temp.children.length; ++i){
+        	if(temp.children.length == 0){
+            	break;
+            }
+        	s.push(temp.children[i]);
+        }
+    }
+}
+
+function BFS_queue(n){
+	var q = [];
+    q.push(n);
+    var temp;
+    
+    while(q.length > 0){
+    	temp = q.shift();
+    	document.write(temp.ID + "<br>");
+        for(var i = 0; i < temp.children.length; ++i){
+        	if(temp.children.length == 0){
+            	break;
+            }
+        	q.push(temp.children[i]);
+        }
+    }
+}
+
+var root = new Object();
+create_tree(root, 3, 3);
+//DFS_recursive(root);
+//DFS_stack(root);
+BFS_queue(root);
+</script>
+</body>
+<html>
+```
