Insertion in tree data structure

1. What is insertion in binary search tree?
2. How do you perform insertion in a binary tree?

What is insertion in binary search tree?

Insert a value in a Binary Search Tree:

A new key is always inserted at the leaf by maintaining the property of the binary search tree. We start searching for a key from the root until we hit a leaf node. Once a leaf node is found, the new node is added as a child of the leaf node.

How do you perform insertion in a binary tree?

Insert Operation

Start searching from the root node, then if the data is less than the key value, search for the empty location in the left subtree and insert the data. Otherwise, search for the empty location in the right subtree and insert the data.