binary tree

noun1

1. •
   A data structure in which each node has at most two children, each node but the root has one parent, and there are no cycles.