Remove "C++" code tags

_posts/2021-04-27-Orthtree.md

@@ -60,7 +60,7 @@ or is only used a small number of times.
 
 Building a new Octree and refining it with the default criteria can be done with only a few lines of code:
 
-```c++
+```
 #include <iostream>
 #include <CGAL/Simple_cartesian.h>
 #include <CGAL/Octree.h>
@@ -100,7 +100,7 @@ int main() {
 
 Once the tree is constructed, it's simple to perform queries:
 
-```c++
+```
 ...
 // Find the 3 nearest points to the search point
 auto search_point = new Point(1, -1, 0);
@@ -111,7 +111,7 @@ octree.nearest_k_neighbors(search_point, 3, std::back_inserter(neighbors));
 
 The tree can also be traversed manually, or with the help of a traversal function:
 
-```c++
+```
 ...
 // Manual traversal to reach the fifth child of the first child of the root
 std::cout << octree.root()[0][4];