홈 > Term: binary search tree
binary search tree
A binary tree where every node's left subtree has keys less than the node's key, and every right subtree has keys greater than the node's key.
- 품사: noun
- 분야/도메인: 컴퓨터 과학
- 카테고리: Algorithms & data structures
- Government Agency: NIST
0
작성자
- GeorgeV
-
(Gold) 1123 포인트 - 100% positive feedback
