QUESTION: definition of depth


  • 0
    E

    So I read online(stack overflow, wikipedia) that the depth of a node is the number of edges to the root node. How come in this question, the minimum depth is 2 when there is a leaf node that is only one edge away from the root (direct child).
    I'm probably missing something. I would appreciate if someone could explain.
    Thanks!


Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.