codehub27

               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...

              Josephus problem is a puzzle problem. A group of people are there. They stand in a circle. Every kth person is eliminated until only one remains. To solve this problem, circular linked list is the best option. C implementation:               This implementation starts from creating Node structure. It has a data and node. There is a function create_Circle(). It is used to create the memory for node. Create the nodes as circular linked list. Josephus elimination function reads the input as number of persons and k value. Using the k value, keep on moving the circular linked list. The kth person is eliminated until the last one is remaining. Code: #include <stdio.h> #include <stdlib.h> //create a   Node structure with data and node struct cl_Node {     int data;     struct cl_Node *next; }; // circular link...

              Circular Linked List is a type of linked list . It has a special feature which connects the last node to head as a circular format. So the traversal becomes the circular one. Implementation: It starts with declaring the Node structure . Next, a function create_Node() is written. It allocates the memory. New node’s data is assigned with data. New node’s next is assigned Null. To traverse a linked list, from the head to last node, each node is traversed and displayed the data. Finally, main() function,nodes are created. The traverse function is called and output is displayed. C Code: #include <stdio.h> #include <stdlib.h> // Node structure is declared struct Node {     int data;     struct Node* next; }; // Let us create a new node struct Node* create_Node(int data) {     struct Node* newNode = (struct Node*) malloc (sizeof(struct Node)); ...