Describe the bug
The exercise says that the 12 should be deleted, but when you scroll down to that step, it shows that the 11 should be deleted.
The 12 does actually get deleted and replaced with its predecessor, it's just saying that the 11 is the one that gets deleted. Everything
Created a persistent binary search tree (PBST) and persistent stack. When adding a new element will create a new stack or PBST with the new element and connect the new PBST or stack to the previous PBST or stack. ***Please see README***
Implemented Dijkstra’s algorithm and compared performance when implemented using fibonacci, binomial and binary heaps in CPP. Ran algorithm on New York’s road network dataset which consisted of around 0.2M nodes and 0.7M edges. Concluded that fibonacci Heap gives performance enhancement on such a large dataset compared to other two heaps.
Receives file as list of cities and distance between these cities. Creates an Adjacency List, graph, then creates a Binomial Queue and uses Dijkstra's Algorithm to continually remove shortest distance between cities. SEE README
Describe the bug

The exercise says that the 12 should be deleted, but when you scroll down to that step, it shows that the 11 should be deleted.
The 12 does actually get deleted and replaced with its predecessor, it's just saying that the 11 is the one that gets deleted. Everything