diff --git a/book.json b/book.json
index ceb0d60b0..31f0f3a82 100644
--- a/book.json
+++ b/book.json
@@ -33,10 +33,6 @@
           "name": "Julia",
           "default": true
         },
-        {
-          "lang": "pseudo",
-          "name": "Pseudocode"
-        },
         {
           "lang": "cs",
           "name": "C#"
diff --git a/contents/euclidean_algorithm/code/pseudo/euclidean.pseudo b/contents/euclidean_algorithm/code/pseudo/euclidean.pseudo
deleted file mode 100644
index c262fc8c2..000000000
--- a/contents/euclidean_algorithm/code/pseudo/euclidean.pseudo
+++ /dev/null
@@ -1,23 +0,0 @@
-# This has not been implemented in your chosen language, so here's pseudocode
-function euclid_sub(Int a, Int b){
-    while (a != b){
-        if (a > b){
-            a = a - b
-        }
-        else
-            b = b - a
-        }
-    }
-}
-
-# This has not been implemented in your chosen language, so here's pseudocode
-function euclid_mod(Int a, Int b){
-    Int temp
-    while (b != 0){
-        temp = b
-        b = a%b
-        a = temp
-    }
-}
-
-
diff --git a/contents/tree_traversal/code/pseudo/Tree.pseudo b/contents/tree_traversal/code/pseudo/Tree.pseudo
deleted file mode 100644
index 74f41d5ac..000000000
--- a/contents/tree_traversal/code/pseudo/Tree.pseudo
+++ /dev/null
@@ -1,78 +0,0 @@
-# This has not been implemented in your chosen language, so here's pseudocode
-type Node{
-    vector{Int} children
-    int ID;
-}
-
-# This has not been implemented in your chosen language, so here's pseudocode
-function DFS_recursive(Node n){
-    // Here we are doing something...
-    print(n.ID)
-
-    for child in n.children{
-        DFS_recursive(child)
-    }
-}
-
-# This has not been implemented in your chosen language, so here's pseudocode
-function DFS_recursive_postorder(Node n){
-
-    for child in n.children{
-        DFS_recursive_postorder(child)
-    }
-
-    // Here we are doing something...
-    print(n.ID)
-}
-
-# This has not been implemented in your chosen language, so here's pseudocode
-# This assumes only 2 children
-function DFS_recursive_inorder_btree(Node n){
-
-    if (size(n.children) > 2)){
-        print("Not a binary tree!")
-        exit(1)
-    }
-
-    if (size(n.children) > 0){
-        DFS_recursive_inorder_btree(n.children[0])
-        print(n.ID)
-        DFS_recursive_inorder_btree(n.children[1])
-    }
-    else{
-        print(n.ID)
-    }
-}
-
-# This has not been implemented in your chosen language, so here's pseudocode
-function DFS_stack(Node n){
-    stack s
-    s.push(n)
-    Node temp
-
-    while(size(s) > 0){
-        print(s.top().ID)
-        temp = s.top()
-        s.pop()
-        for child in temp.children{
-            s.push(child)
-        }
-    }
-}
-
-# This has not been implemented in your chosen language, so here's pseudocode
-function BFS_queue(Node n){
-    queue q
-    q.push(n)
-    Node temp
-
-    while(size(q) > 0){
-        print(q.front().ID)
-        temp = q.front()
-        q.pop()
-        for child in temp.children{
-            q.push(child)
-        }
-    }
-}
-