The following is the definition of Binary Search Tree(BST) according to Wikipedia Binary Search Tree is a node-based binary tree data structure which has the following properties: The left subtree of a node contains only nodes with keys lesser than the no

A recursive approach to insert a new node in a BST is already discussed in the post: Binary Search Tree | SET 1.In this post, an iterative approach to insert a node in BST is discussed.

Step 1: Create a function to insert the given node and pass two arguments to it, the root node and the data to be inserted. Step 2: Define a temporary node to store the popped out nodes from the queue for search purpose. Step 3: Define a queue data struct