[Python] TreeHeight

https://app.codility.com/demo/results/trainingMGZBGQ-R79/

Test results - Codility

---

Point

• dfs를 이용해서 height(depth)를 카운트한다

Tip

• 탈출 조건을 잘 분기해준다
• 탈출 조건의 리턴값을 잘 핸들링해준다

Task Score

100%

Correctness

100%

Performance

Not assessed

Detected time complexity

 

from extratypes import Tree  # library with types used in the task

def dfs(tree, height):
    left_height = right_height = 0

    if tree.l:
        left_height = dfs(tree.l,height+1)
    if tree.r:
        right_height = dfs(tree.r,height+1)
    
    if tree.l or tree.r:
        return max(left_height,right_height)
    else:
        return height

def solution(T):
    return dfs(T,0)

 

문제를 푸는데 도움이 된 테스트 케이스