Question

Explain the following term:

Binary Tree

Answer 1

• A binary tree is a hierarchical data structure in which each node has at most two children, referred to as the left child and the right child. It begins with a top node called the root, and nodes with no children are known as leaf nodes.
• This structure is the foundation for efficient algorithms like Binary Search Trees (BST) and Heaps. It is widely used for fast searching, sorting, and representing hierarchical data like file systems or organisation charts.