Rooted binary tree

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In computer science, a rooted binary tree is a tree with a root node in which every node has at most two children. A rooted binary tree is a tree with a root which has degree 2 and all other nodes of degree 3.[1]

References[edit]

  1. ^ Igusa, Kiyoshi. "Binary trees". Brandeis Math Department.