홈 > Term: binary tree
binary tree
A tree with at most two children for each node. Formal Definition: A binary tree either
- is empty (no nodes), or
- has a root node, a left binary tree, and a right binary tree.
- 품사: noun
- 분야/도메인: 컴퓨터 과학
- 카테고리: Algorithms & data structures
- Government Agency: NIST
0
작성자
- GeorgeV
-
(Gold) 1123 포인트 - 100% positive feedback
