Traverse nodes at p ' s ▁ level ▁ and ▁ find ▁ ▁ ▁ and ▁ return ▁ the ▁ first ▁ node ' s first child
while ( temp != None ) : NEW_LINE INDENT if ( temp . left != None ) : NEW_LINE INDENT return temp . left NEW_LINE DEDENT if ( temp . right != None ) : NEW_LINE INDENT return temp . right NEW_LINE DEDENT temp = temp . nextRight NEW_LINE DEDENT