Binary Tree

Binary Tree
A tree whose elements have at most 2 children is called a binary tree. Since each element in a binary tree can have only 2 children, we typically name them the left and right child. the speed of searching in binary tree is O(nlogn) that means that it runs faster as binary search. the concept of binary tree is similar to double linked listed but it has 2 pointer which point to left and right. the function of using binary tree is to check a number with fast search.

Source : https://www.geeksforgeeks.org/binary-tree-data-structure/

Learn more : https://www.geeksforgeeks.org/binary-tree-data-structure/