binary trees

     

In computer science, a binary tree is a tree ata structure in which each node has at most two children. Typically the child nodes are called left and right. Binary trees are commonly used to implement binary search trees and binary heaps.

Found pages about binary trees

Users that searched for binary trees