This document discusses binary trees, including an introduction defining their structure as a finite set of elements partitioned into a root element and left and right subtrees, with each node having no more than two descendants. It provides an example of a binary tree and outlines the different types of binary trees and their properties.

1. Binary tree
Submitted by
Rishi Ram Khanal
BIM 2nd Semester (TU)

2. Content
• Introduction of binary tree
• Example of binary tree
• Types of binary tree
• Properties of binary tree

3. Introduction
• Binary tree is a finite set of element .
• It is either empty or partitioned into three
disjoint subset .
• First subset contain the single element called
root .
• Other subset called right and left sub tree of
origin tree.
• It’s named because each node can have most
two descendant.

4. Example