-
Tree (root, parent, leaf)코딩Coding/알고리즘♡Algorithm♡ 2023. 4. 24. 20:41728x90
Each node in the tree can be connected to many children (depending on the type of tree), but must be connected to exactly one parent,[1] except for the root node, which has no parent.leaf leaf leaf leaf(children) \/ \/ parent parent \/ root
https://en.wikipedia.org/wiki/Tree_(data_structure)Tree (data structure) - Wikipedia
From Wikipedia, the free encyclopedia Abstract data type simulating a hierarchical tree structure and represented as a set of linked nodes Not to be confused with Trie, a specific type of tree data structure. This unsorted tree has non-unique values and is
en.wikipedia.org
반응형'코딩Coding > 알고리즘♡Algorithm♡' 카테고리의 다른 글
How a Computer Broke a 50-Year Math Record (0) 2023.05.23 Data Architecture: Data-Driven Design for Scale and Automation(part1-2 (0) 2023.05.01 그래픽 엔진 강의(AI 교육 캠프 그래프 데이터베이스 시리즈 작성자: Dr. Ray (0) 2023.04.25 알고리즘 기초 10^8=1초에 1억회 연산 가능 , 동적 프로그래밍 (0) 2023.04.25 재귀적으로 문제 해결하기 (1) - (0) 2023.04.23 팩토리얼 계산하기 - 스택 오버 플로우 조심 (0) 2023.04.23 C❤️연결리스트 구현하기 (0) 2023.04.23 Asymptotic analysis (2) 2023.04.21