Question d’entretien chez Uni Cards

Rightmost leaf node in a complete binary tree(Expected complexity : O(logn * logn))