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 8 subcategories, out of 8 total.

B

C

C cont.

R

S

S cont.

T

Media in category "Binary trees"

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

Last modified on 28 November 2013, at 19:12