A binary tree is finite set of data items which is either empty or consists of a single item called the root and two disjoint binary trees called the left subtree and right subtree.
A binary tree is a very important and the most commonly used non-linear data structure.
In a binary tre the masimum degree of any node is at most two. That means, there may be a zero degree node or one degree node and two degree node.
No comments:
Post a Comment