A Python implementation of Hilbert’s Hotel using data structures and algorithms, developed as part of the Object-Oriented Data Structures course.
A hotel with an infinite number of rooms, all already occupied, but it can still admit new guests by shifting every guest to the next room.
The main goal is to minimize the number of unoccupied rooms while preventing room numbers from growing excessively large.
An AVL tree is used to represent the hotel, with each node corresponding to a hotel room.
Room numbers are computed using the Morton Curve (Z-order Curve), a non-overlapping space-filling curve that guarantees unique room numbers without repetition.
python 404_Hotel_Not_Found.py