Data Structures Binary Tree

In computer science, a binary tree is a tree data structure where each node can have a maximum of two child nodes. Usually,
these nodes are referenced as left and right - as in a
left child node and a right child node.

Every node in a binary tree has a left and right reference along with the data element. The node at the top of the hierarchy of a tree is called the root node.

What is a binary tree in data structures?
A binary tree is a tree-type non-linear data structure with a maximum of two children for each parent.

A binary tree is

either empty or consists

of a node called the root together

with two binary trees called
the left subtree
and the right

A Full Binary Tree is a binary tree where every node within the tree has either two or zero child nodes

The nodes of a binary tree
can be numbered in a natural way, level by level, left to right