Hello.

Can someone explain what is time complexity of this algorithm :

Thanks !!Code:`int maxDepth(struct node* node) {`

if (node==NULL) {

return(0);

}

else {

// compute the depth of each subtree

int lDepth = maxDepth(node->left);

int rDepth = maxDepth(node->right);

// use the larger one

if (lDepth > rDepth) return(lDepth+1);

else return(rDepth+1);

}

}