codehub27

              Graph is a non-linear data structure. It can be represented by adjacency matrix or adjacency list. Let us discuss the methods in detail. This blog post deals with the first method Adjacency matrix. Adjacency matrix:               It is a two-dimensional matrix.it deals with the edges present between nodes.   If the edges found, it assigns the weight as 1. Otherwise, it values it as 0. Code implementation: This code includes the built-in header file. It defines the vertices as 4. A function ‘Display_Matrix()’ is used to represent the graph. ‘main()’ function initialises the graph. It assigns the value for matrix.  Finally,it calls the ‘Display_Matrix’ function to display the output. Code: #include <stdio.h> #define V 4   // Declare the number of vertices void Display_Matrix(int graph[V][V]) {     for (int i = 0; ...

               Binary tree is a tree which has two nodes. It has a root node. It has a left sub tree and right sub tree. Let us implement the c program to count the leaf nodes and height of a binary tree. C implementation:               This implementation starts by including header files. Next, declare the node structure for tree. It has node with data, left and right values. Now, a new node is created by allocating its memory. The values are initialised.   To calculate the heights of the tree, traverse the tree. To count the leaf nodes, check the root nodes, traverse each sub tree separately and count the nodes. In the main() function, create the root node and all child nodes by using the newNode() function. Call the height() function and countLeafNodes() function to display the output. C Code: #include <stdio.h> #include <stdlib.h> // D...

               As we discussed the basic operations in Binary Search Tree , here we implement the delete operation in Binary Search Tree . Deletion can be implemented as three types. ·        Node has one child – you can replace the node with its child node. ·        Node has two children – it changes the node to the smallest value in the right                                                 Subtree and deleted the successor. ·        Node has no child – it deletes the node. #include <stdio.h> #include <stdlib.h> // Create   BST node struct BST_Node {     int b_data;     ...

               Binary Search Tree is a binary Tree which follows a unique key and tree ordering. It strictly follows the left and right nodes values should be in order in such that it satisfies the binary tree condition. Let us implement the searching in Binary Search Tree in C language. Program implementation: It includes the header files. The Node is created first. It has a data, left child and right child. To create a node , memory should be allocated. The data, left, right node pointers are assigned with the node. Next, insert function is created. It reads the data and assigns the left and right pointer. Search function is implemented. It gets the value from the user. It checks the value in the tree. If the value is found, it displays the found message. Otherwise, it displays not found message. Finally, it prints the value.   C Code: #include <stdio.h> #include <stdlib.h> struct BST_Node { ...

       Binary tree is a tree which has almost two child nodes for each node. It can be traversed by three ways. Preorder, Post order and in order are the three types.  In order traversal is implemented in previous blog post. Pre order and post order traversals are implemented here…. C implementation: It starts from the including the header files. First, a structure of the node is declared. It has a data, left and right members. ‘create_Node()’   gets the input as data. It allocates the memory. it assigns data and its child data. Preorder Traversal: It follows Root -> Left -> Right principle.   Postorder Traversal: It follows Left -> Right -> Root principle. Finally, main() function calls the functions and display the output. Code: #include <stdio.h> #include <stdlib.h> // Define the structure of a node struct b_Node {     int b_data;     struct b_Node *t_left, *t_right...

              Binary tree has a root node with two child nodes. Child nodes are named as left child and right child. Let us create a binary tree in c . C implementation:   This implementation starts from the including the built-in header files. First, a node structure is created using structure. It has the member variables as data,left and right nodes. ‘create_Node()’   is used to create node. It allocates the memory for new node. The data and its position is assigned. ‘insert()’- This function is used to add the nodes to binary node. It includes the data. ‘in_order()’ -It is a type of traversal to print the data in order. ‘main()’- It helps to get the value from the user and call the functions. Finally, it prints the output value. Code: #include <stdio.h> #include <stdlib.h> // Create   a node structure struct b_Node {     int b_data;     struct b_Node *c_left, *c_r...