Tricks to compute the time and space complexities. Part-2 (Binary Tree)
December 29, 2019How to compute the time and space complexity of Binary Tree Algorithms
January 2, 2020Find minimum cost to travel to the destination railways station
There are N stations on a railway track. You are at the first station and you want to go to the final railway station. You can either go directly or take breaks in between.
Given the cost of travel for each pair of stations, find the minimum cost of travel.