1. 아래 Tree 구조에 대하여 preorder 순서로 처리한 결과는?

  • 1
    a -> b -> d -> c -> e -> g -> h -> f

  • 2
    d -> b -> g -> h -> e -> f -> c -> a

  • 3
    a -> b -> c -> d -> e -> f -> g -> h

  • 4
    a -> b -> d -> g -> e -> h -> c -> f
--:--
오류 내용 신고