홈 > Term: ordered tree
ordered tree
A tree where the children of every node are ordered, that is, there is a first child, second child, third child, etc. An unordered tree may be thought of as a recursive bag, while an ordered tree is a recursive list.
- 품사: noun
- 분야/도메인: 컴퓨터 과학
- 카테고리: Algorithms & data structures
- Government Agency: NIST
0
작성자
- GeorgeV
- 100% positive feedback