diff --git a/Spatial_searching/examples/Spatial_searching/CMakeLists.txt b/Spatial_searching/examples/Spatial_searching/CMakeLists.txt
index c4a335960b5..1f5a7059a65 100644
--- a/Spatial_searching/examples/Spatial_searching/CMakeLists.txt
+++ b/Spatial_searching/examples/Spatial_searching/CMakeLists.txt
@@ -43,6 +43,11 @@ create_single_source_cgal_program( "iso_rectangle_2_query.cpp" )
 
 create_single_source_cgal_program( "nearest_neighbor_searching.cpp" )
 
+find_package( TBB QUIET )
+if(TBB_FOUND)
+  cgal_target_use_TBB(nearest_neighbor_searching)
+endif()
+
 create_single_source_cgal_program( "searching_with_circular_query.cpp" )
 
 create_single_source_cgal_program( "searching_with_point_with_info.cpp" )
diff --git a/Spatial_searching/examples/Spatial_searching/nearest_neighbor_searching.cpp b/Spatial_searching/examples/Spatial_searching/nearest_neighbor_searching.cpp
index 8055c8be058..4dc40cd9176 100644
--- a/Spatial_searching/examples/Spatial_searching/nearest_neighbor_searching.cpp
+++ b/Spatial_searching/examples/Spatial_searching/nearest_neighbor_searching.cpp
@@ -20,6 +20,9 @@ int main() {
 
   Tree tree(points.begin(), points.end());
 
+  // The tree can be built in parallel
+  tree.build<CGAL::Parallel_if_available_tag>();
+
   Point_d query(0,0);
 
   // Initialize the search structure, and search all N points