diff --git a/SearchStructures/examples/RangeSegmentTrees/range_tree_2.cpp b/SearchStructures/examples/RangeSegmentTrees/range_tree_2.cpp
old mode 100644
new mode 100755
index 06a9891483d..aa4171d1613
--- a/SearchStructures/examples/RangeSegmentTrees/range_tree_2.cpp
+++ b/SearchStructures/examples/RangeSegmentTrees/range_tree_2.cpp
@@ -32,14 +32,14 @@ int main()
   last = InputList.end();
   std::cerr << InputList.size();
 
-  Range_tree_2_type *Range_tree_2 = new Range_tree_2_type(first,last);
+  Range_tree_2_type Range_tree_2(first,last);
 
   Key a=Key(4,8.1);
   Key b=Key(5,8.2);
   Interval win=Interval(a,b);
 
   std::cerr << "\n Window Query: \n";
-  Range_tree_2->window_query(win, std::back_inserter(OutputList));
+  Range_tree_2.window_query(win, std::back_inserter(OutputList));
   current=OutputList.begin();
 
   while(current!=OutputList.end())
@@ -48,7 +48,7 @@ int main()
     current++;
   }
 
-  if(Range_tree_2->range_tree_2->is_valid())
+  if(Range_tree_2.range_tree_2->is_valid())
     std::cerr << "Tree is valid\n";
   else
     std::cerr << "Tree is not valid\n";
diff --git a/SearchStructures/examples/RangeSegmentTrees/software_design_rgs.cpp b/SearchStructures/examples/RangeSegmentTrees/software_design_rgs.cpp
old mode 100644
new mode 100755
index 2c0c4a9c887..998e7d05a79
--- a/SearchStructures/examples/RangeSegmentTrees/software_design_rgs.cpp
+++ b/SearchStructures/examples/RangeSegmentTrees/software_design_rgs.cpp
@@ -26,10 +26,11 @@ class Interval_traits{
 typedef Tree_anchor<Data,Window> Tree_Anchor;
 typedef Segment_tree_d<Data,Window,Interval_traits> Segment_Tree_d;
 
-void remove_warning(Segment_Tree_d*){}
 
 int main(){
   Tree_Anchor *anchor = new Tree_Anchor;
   Segment_Tree_d *segment_tree = new Segment_Tree_d(*anchor);
-  remove_warning(segment_tree);
+  delete anchor;
+  delete segment_tree;
+  return 0;
 }