홈 > Term: in-order traversal
in-order traversal
Process all nodes of a tree by recursively processing the left subtree, then processing the root, and finally the right subtree.
- 품사: noun
- 분야/도메인: 컴퓨터 과학
- 카테고리: Algorithms & data structures
- Government Agency: NIST
0
작성자
- GeorgeV
-
(Gold) 1123 포인트 - 100% positive feedback
