DATA STRUCTURES AND ALGORITHMS :

DATA STRUCTURES AND ALGORITHMS .

Please give proper solution.

//Graph #include using namespace std; int graph[100][100]; bool visited[100]; int node, edge; void Initialize() { for(int i=0;i

void DFS(int source) { visited[source] = true; cout

//BFS void BFS(int source) { visited[source] = true; queue q; q.push(source); while(!q.empty()) { int x = q.front(); q.pop(); for(int i=0;i 1. Write a function that will find weather a BST is height balanced or not? To check if a tree is height-balanced, get the height of left and right subtrees. Return true if difference between heights is not more than 1 and left and right subtrees are balanced, otherwise return false. 2. You have to decide whether a given arbitrary connected graph can be bicolored. That is, if one can assign colors (from a palette of two) to the nodes in such a way that no two adjacent nodes have the same color. To simplify the problem you can assume: No node will have an edge to itself. The graph is non-directed. That is, if a node a is said to be connected to a node b, then you must assume that b is connected to a. The graph will be strongly connected. That is, there will be at least one path from any node to any other node. Input The input consists of several test cases. Each test case starts with a line containing the number n (1<>