purpose computer programming language that is concurrent
,
classbased
,
object
-
oriented
,[
13
]
and specifically designed
…
6.5
깊이 우선 탐색
트리를 탐색하는 방법은 응용 방법에 따라 몇 가지가 있습니다. 먼저 깊이 우선 탐색
depth
-
first
search
,
DFS
부터 시작합니다.
DFS
는 트리의 루트에서 시작하여 첫 번째 자식 노드를 선택합니다.
자식이 자식을 가지고 있다면 첫 번째 자식을 다시 선택합니다. 자식이 없는 노드에 도착하면
부모 노드로 거슬러 올라가고 부모 노드에 다음 자식이 있다면 그쪽으로 이동합니다. 다음 자
식이 없다면 다시 거슬러 올라갑니다. 루트의 마지막 노드까지 탐색하면 종료합니다.
DFS
를 구현하는 방법에는 재귀적 방법과 반복적 방법 두 가지가 있습니다. 재귀적 구현은 단
순하고 우아합니다
(파일명:
WikiNodeExample.java ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.
Julian F.
Head of Cybersecurity
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.
Addison B.
Field Engineer
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.
Amir M.
Data Platform Tech Lead
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.