### Problem Statement :

```You are given a pointer to the root of a binary search tree and values to be inserted into the tree. Insert the values into their appropriate position in the binary search tree and return the root of the updated binary tree. You just have to complete the function.

Input Format

You are given a function,

Node * insert (Node * root ,int data) {

}
Constraints

No. of nodes in the tree <= 500
Output Format

Return the root of the binary search tree after inserting the value into the tree.```

### Solution :

```                            ```Solution in C :

In C++ :

/*
Node is defined as

typedef struct node
{
int data;
node * left;
node * right;
}node;

*/
#include<queue>
queue<node *> Queue;

node * insert(node * root, int value)
{
node *n=new node();
n->data=value;
n->left=NULL;
n->right=NULL;
if(!root){
root=n;
return root;
}
node *temp=root;
while(1){
if(temp->data > n->data){
if(temp->left)
temp=temp->left;
else{
temp->left=n;
break;
}
}
else
{
if(temp->right)
temp=temp->right;
else
{
temp->right=n;
break;
}
}
}
return root;
}

In Java :

/* Node is defined as :
class Node
int data;
Node left;
Node right;

*/

static Node Insert(Node root,int value)
{
if(root == null)
{
root = new Node();
root.data = value;
}
else if(root.data > value)
{
if(root.left == null)
{
Node left = new Node();
left.data = value;
root.left = left;
}
else //keep looking, strictly on left as value is smaller than root
{
Insert(root.left, value);
}

}
else
{
if(root.right == null) //place for value found
{
Node right = new Node();
right.data = value;
root.right = right;
}
else
{
Insert(root.right, value);
}
}
return root;
}

In C :

/* you only have to complete the function given below.
node is defined as

struct node {

int data;
struct node *left;
struct node *right;

};

*/
struct node* insert( struct node* root, int data ) {
struct node *prev_node = NULL;
struct node *temp_node = root;

while (temp_node) {
prev_node = temp_node;

if (data < temp_node->data) {
temp_node = temp_node->left;
}

else {
temp_node = temp_node->right;
}
}

struct node *new_node = malloc(sizeof(struct node));
new_node->data = data;

if (!prev_node) {
root = new_node;
}

else {
if (data < prev_node->data) {
prev_node->left = new_node;
}

else {
prev_node->right = new_node;
}
}

return root;
}

In python3 :

#Node is defined as
#self.left (the left child of the node)
#self.right (the right child of the node)
#self.info (the value of the node)

def insert(self, val):
if not self.root:
self.root = Node(val)
else:
node = self.root
while(True):
if (node.info>val):
if node.left:
node = node.left
else:
node.left = Node(val)
return
else:
if node.right:
node = node.right
else:
node.right = Node(val)
return
#Enter you code here.```
```

## Tree : Top View

Given a pointer to the root of a binary tree, print the top view of the binary tree. The tree as seen from the top the nodes, is called the top view of the tree. For example : 1 \ 2 \ 5 / \ 3 6 \ 4 Top View : 1 -> 2 -> 5 -> 6 Complete the function topView and print the resulting values on a single line separated by space.

## Tree: Level Order Traversal

Given a pointer to the root of a binary tree, you need to print the level order traversal of this tree. In level-order traversal, nodes are visited level by level from left to right. Complete the function levelOrder and print the values in a single line separated by a space. For example: 1 \ 2 \ 5 / \ 3 6 \ 4 F

## Binary Search Tree : Insertion

You are given a pointer to the root of a binary search tree and values to be inserted into the tree. Insert the values into their appropriate position in the binary search tree and return the root of the updated binary tree. You just have to complete the function. Input Format You are given a function, Node * insert (Node * root ,int data) { } Constraints No. of nodes in the tree <

## Tree: Huffman Decoding

Huffman coding assigns variable length codewords to fixed length input characters based on their frequencies. More frequent characters are assigned shorter codewords and less frequent characters are assigned longer codewords. All edges along the path to a character contain a code digit. If they are on the left side of the tree, they will be a 0 (zero). If on the right, they'll be a 1 (one). Only t

## Binary Search Tree : Lowest Common Ancestor

You are given pointer to the root of the binary search tree and two values v1 and v2. You need to return the lowest common ancestor (LCA) of v1 and v2 in the binary search tree. In the diagram above, the lowest common ancestor of the nodes 4 and 6 is the node 3. Node 3 is the lowest node which has nodes and as descendants. Function Description Complete the function lca in the editor b

## Swap Nodes [Algo]

A binary tree is a tree which is characterized by one of the following properties: It can be empty (null). It contains a root node only. It contains a root node with a left subtree, a right subtree, or both. These subtrees are also binary trees. In-order traversal is performed as Traverse the left subtree. Visit root. Traverse the right subtree. For this in-order traversal, start from