This post talks about what are the basic & auxiliary operations supported by a binary tree, Finally, we will also take a look at applications where binary are used.

**Operations on Binary Trees:**

**Basic Operations:**

- Inserting an element into a tree
- Deleting an element from a tree
- Searching an element in the tree
- Traversing the tree

**Auxiliary Operations:**

- Finding the size of the tree
- Finding the height of the tree
- Finding level which has a maximum sum
- Finding the least common ancestor (LCA) for a given pair of nodes and many more.

**Applications of Binary Trees:**

Below are some of the applications where binary trees usually play an important role:

- Expression trees are used in compilers
- Huffman coding trees, usually that are used in data compression algorithms
- Binary Search Tree (BST) which supports search, insertion, and deletion on a collection of items in
**O (log n)**average - Priority Queue (PQ) which supports search and delete of minimum and maximum on a collection of items in logarithmic time in the worst case.

**You May Also Like:**

Introduction to Tree Data Structure

Introduction to Binary Tree

Structure of Binary Trees

That’s all about **Operations and use of Binary Trees**

If you have any feedback or suggestion please feel free to drop in below comment box.