본문 바로가기
English

Binary search trees

  • A binary search tree (BST) stores values so they stay sorted and are fast to find.
  • Each node holds a value and links to up to two children: a left and a right.
  • The top node is the root. A node with no children is a leaf.

교재 자료

로그인 또는 계정 만들기

IGCSE, A-Level & AP