Problem source: [click](https://www.codechef.com/problems/BINPALIN)↵
↵
The problem states that you'll be given some queries of 2 types. You will either be asked to add a binary digit at the end of the existing string or you'll be asked to delete the last digit. After each operation, you're required to print the longest palindromic substring of that string. ↵
↵
I am awarethat there existsof a solution involving hashing ([Editorial](https://discuss.codechef.com/t/binpalin-editorial/47263)). But I'm wondering how the regular palindromic tree can be modified to handle this.
↵
The problem states that you'll be given some queries of 2 types. You will either be asked to add a binary digit at the end of the existing string or you'll be asked to delete the last digit. After each operation, you're required to print the longest palindromic substring of that string. ↵
↵
I am aware
