diff --git a/df/da7/queue__using__array2_8cpp_source.html b/df/da7/queue__using__array2_8cpp_source.html
index 8f9c08260..152490ccb 100644
--- a/df/da7/queue__using__array2_8cpp_source.html
+++ b/df/da7/queue__using__array2_8cpp_source.html
@@ -117,62 +117,62 @@ $(function(){initNavTree('df/da7/queue__using__array2_8cpp_source.html','../../'
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
18 cout <<
"\nUnderflow";
-
-
-
-
22 cout <<
"\n" << queue[front++] <<
" deleted";
-
23 for (
int i = front; i < rear; i++) {
-
24 queue[i - front] = queue[i];
-
-
-
-
-
-
-
-
32 for (
int i = front; i < rear; i++) {
-
33 cout << queue[i] <<
"\t";
-
-
-
-
-
-
-
-
-
-
43 cout <<
"\nEnter Your Choice : ";
-
-
-
46 cout <<
"\nInsert : ";
-
-
-
-
-
-
-
-
-
-
-
+
+
+
+
+
+
+
+
9 std::cout <<
"\nOverflow";
+
+
+
+
+
+
+
+
17 std::cout <<
"\nUnderflow";
+
+
+
+
21 std::cout <<
"\n" <<
queue[front++] <<
" deleted";
+
22 for (
int i = front; i < rear; i++) {
+
+
+
+
+
+
+
+
+
31 for (
int i = front; i < rear; i++) {
+
32 std::cout <<
queue[i] <<
"\t";
+
+
+
+
+
+
+
39 std::cout <<
"\n1. Enque";
+
40 std::cout <<
"\n2. Deque";
+
41 std::cout <<
"\n3. Print";
+
42 std::cout <<
"\nEnter Your Choice : ";
+
+
+
45 std::cout <<
"\nInsert : ";
+
+
+
+
+
+
+
+
+
+
+
+