From 451341bd82e1ef7715d05d07c777686a78dc4935 Mon Sep 17 00:00:00 2001 From: sajib21 Date: Sun, 3 Mar 2019 18:33:32 +0600 Subject: [PATCH] Update README.md --- README.md | 4 ---- 1 file changed, 4 deletions(-) diff --git a/README.md b/README.md index 2ee7cca..7aa0e33 100644 --- a/README.md +++ b/README.md @@ -9,7 +9,3 @@ In BFS, the values in each node are separated level and node wise. In DFS, the program will wait for you to press a key (Please press enter here). Then it will move to the next child or will be returned to the parent. In each node, the information about the values, pointers and child nodes will be printed. -# Funny Back Story -I didn't do the assignment at first. But then, in the lab, our respected sir told us that that day is the last day he is going to see this assignment.
-I had only two hours in my hand when I started coding. I was sure that I couldn't complete it in time but I never stopped.
-And finally, I don't know how I pulled this out of myself within two hours but I did it (Only insert functionality was required). I consider it one of the greatest challenge in my coding career so far. :D :D