Leetcode 1651. Hopper Company Queries III

Given a company hierarchy as a tree and a long sequence of mixed operations that update node states and ask for distance/connectivity/ancestor-related answers, process all queries efficiently under tight time limits. This hard variant requires advanced tree techniques (binary lifting, Euler-tour + segment tree, centroid decomposition or dynamic tree structures) to handle many updates and queries on large trees.