The document describes a proposed Arduino-based RFID parking allocation system. The system uses RFID tags embedded in customer cards to identify vehicles and assign parking slots. When a customer arrives, their card is scanned to obtain an identification number, which is added to a queue. Numbers in the queue are then inserted into a binary search tree, with each node containing an assigned parking token. When a vehicle leaves, the corresponding token is removed from the tree. The system aims to automate parking allocation and reduce traffic by pre-assigning slots, using efficient data structures for real-time operation and minimum time complexity. It was found that using a binary search tree for allocation provided faster processing than a queue.