Given a tree, find OR of the path between two nodes (u,v).
Please refer this link for the question: https://drive.google.com/file/d/1y1lcx3YrdPO-sbr2rJQYtpkLPQvF-z2A/view?usp=sharing
How to do it using binary lifting? (Please share your code if you're able to do it)