also according to the union operation applied in the video(since it is not union by rank) what will be the worst case complexity of find operation and the amortised complexity of find operation in this case as now the depth of the tree can be maximum n for n nodes?
