priority queue

Inspiration

To practice heap data structure

What it does

Store orderable data from smallest to biggest

How I built it

Using binary_tree ADT and basic class structure

Challenges I ran into

Minor bug when testing

Accomplishments that I'm proud of

Finished within an hour

What I learned

Implementation of Heap data sture

What's next for priority queue

n/a

Built With

• python