Stack and Queue

I will start this post today and will finish it tomorrow. Today I received the 4K monitor that I ordered last week from Dell. The box looks like it is for a regular flat screen TV. My wife and I moved it downstairs. I will open the box over the weekend. Hopefully the new computer will arrive before the end of the weekend.

Tomorrow came and went. My wife had a dentist appointment, we had to stop by my son’s place and finally we stopped at the grocery store. When we got home it was past 06:00 PM. We go to sleep shortly after 07:00 PM so we sat down in the living room and chatted. Continue reading “Stack and Queue”

Binary Tree – Heap

I read an article or two from Medium every day. A few days ago I read “Binary Trees: The Heap” by David Pynes. The idea behind a binary tree or heap is to be able to associate values with associated priorities. For example, assume you are in line at an emergency room in a hospital. When you arrive and register the facility may use a plain queue (FIFO) to wait for a physician. What happens if a patient in worse condition that you arrives later. The logical thing would be to allow them to see a physician before patients that are less ill. Continue reading “Binary Tree – Heap”

Queue implemented with Stacks

Yesterday I was talking with a coworker about the time it takes (me) to produce a post in this blog. Towards the end of the day, after a nice walk with my wife, I developed the code for this post. My inspiration came from a YouTube video by Irfan Baqui.  I am a firm believer that in order to verify you understand some subject, you need to write about it. The reason for writing is that one explains the subject to the reader. Continue reading “Queue implemented with Stacks”