# README
This is to simulate a movie theatre booking system
Used a custominized binary search tree to achieve this assignment, the Node value
are datehour integal, using BST will help to acheive log(n) speed over time.
there is a slice in each of the Node, which stores the schedules in the same exact hours
in other venues.
API is published at https://goschoolassignment2.onrender.com
# Packages
No description provided by the author