Category:Binary trees

A binary tree in computer science is a tree data structure in which each node has at most two child nodes, usually distinguished as "left" and "right". Nodes with children are parent nodes, and child nodes may contain references to their parents.

Subcategories

This category has the following 11 subcategories, out of 11 total.

B

C

K

R

S

T

Media in category "Binary trees"

The following 200 files are in this category, out of 205 total.

(previous page) (next page)(previous page) (next page)