# What is Binary Tree in Data Structures ?

## What is Binary Tree in Data Structures ?

- Binary tree is a special type of data structure. In binary tree, every node can have a maximum of 2 children, which are known as Left child and Right Child.
- It is a method of placing and locating the records in a database, especially when all the data is known to be in random access memory (RAM).
- A binary tree has the benefits of both an ordered array and a linked list as search is as quick as in a sorted array and insertion or deletion operation are as fast as in linked list.

What is Binary Tree in Data Structures

## Representation of Binary Tree using Array

- Binary tree using array represents a node which is numbered sequentially level by level from left to right. Even empty nodes are numbered.