Lab9%20(9)(1… (9) - JupyterLab

Using C++, please explain aswell. Thank you, I will upvote! Implement a dynamic programming algorithm for finding a minimum vertex cover of a tree. • Input will come from cin – The first line will contain two integers, n and m, separated by a space. – n is a number of vertices and m is a number of edges. – The next m lines will contain two integers, u and v, separated by a space. – Each of these pairs represents an undirected edge {u, v}. • Print output to cout – Your output should consist of a single integer representing the size of the vertex cover discovered.

Please refer to C language if ever. Show what is written by the following segments of code:a) P = (node) malloc(sizeof(NodeEntry));    Q = (node) malloc(sizeof(NodeEntry));    P->info = 5; Q->info = 6;    P = Q;    P->info = 1;    printf(“%d %d”, P->info, Q->info);b) P = (node) malloc(sizeof(NodeEntry));    P->info = 3;    Q = (node) malloc(sizeof(NodeEntry));    Q->info = 2;    P = (node) malloc(sizeof(NodeEntry));    P->info = Q->info;    Q->info = 0;    printf(“%d %d”, P->info, Q->info);

Question 1  class tree: def __init__(self, key): self.key = key self.left = None self.right = None def find_longest_word(self): res = root.data t2 = tree('apple') t2.left = tree('banana') t2.left.right = tree('orange') t2.right = tree('strawberry') t2.right.left = tree('grape') t2.right.left.right = tree('peach') print(find_longest_word)     Hello, need help with this python code. Im trying to have a binary tree that can determine which nodes have the longest words. I got stuck on the function part. please help and thank you. It should return strawberry! ......

What are some of the most frequent computer programs that are used to solve the issue of the least spanning tree?

convert this C++ codes into C language    #include <bits/stdc++.h>using namespace std; // tree node is definedclass tree{     public:  int data;  tree *left;  tree *right;}; void printSibling(tree* root){ //Declare queue using STL  queue<tree*> q; //enqueue the root q.push(root); vector<int> store;  tree* temp; //do the level order traversal & check for siblings while(!q.empty()){  //dequeue  temp=q.front();  q.pop();  //if the current node has only one child   //definitely the child has no sibling  //store the child node value  if(temp->left==NULL && temp->right!=NULL){   store.push_back(temp->right->data);  }   if(temp->left!=NULL && temp->right==NULL){   store.push_back(temp->left->data);  }  // do level order traversing  if(temp->right)   q.push(temp->right);  if(temp->left)   q.push(temp->left); } //if no node found without having sibling //vector size is zero //print -1 if(store.size()==0){  printf("-1, no…

Picture a collection of non-repeating of integers. Depending on the order in which these values are inserted into a maxheap data structure, several different maxheaps can emerge. What will be true about the smallest value in the collection of integers in all of the possible maxheaps? Group of answer choices The smallest value will be at the rightmost leaf at the deepest level of the maxheap. The smallest value will be at one of the leaf nodes of the maxheap. Without knowing the actual values of the set, no conclusions can be drawn about the location of the smallest value in the maxheap. The smallest value could be located at any node of the maxheap other than the root.

Convert in C language code   #include <bits/stdc++.h>using namespace std; // tree node is definedclass tree{        public:        int data;        tree *left;        tree *right;}; void printSibling(tree* root){    //Declare queue using STL     queue<tree*> q;    //enqueue the root    q.push(root);    vector<int> store;     tree* temp;    //do the level order traversal & check for siblings    while(!q.empty()){        //dequeue        temp=q.front();        q.pop();        //if the current node has only one child         //definitely the child has no sibling        //store the child node value        if(temp->left==NULL && temp->right!=NULL){            store.push_back(temp->right->data);        }         if(temp->left!=NULL && temp->right==NULL){            store.push_back(temp->left->data);        }        // do level order traversing        if(temp->right)            q.push(temp->right);        if(temp->left)…

8.11 lab AVL tree nth largest operations

Develop a Python program that will: 1. accept a list of integers 2. store the integers in a tree data structure 3. Display the minimum value in an efficient manner (ie. using binary tree traversal method, not linear search) 4. Display the maximum value in an efficient manner (ie. using binary tree traversal method, not linear search) Parts #1 & #2 have been done for you. See the attached starter code in P8BinaryTreeMinMax1.py Please supply the functions for #3 & #4. The min and max functionality should be coded as Python functions.

Assume that disk block size is 1024 bytes. A B+-tree is created on an attribute of length 12 bytes. Each tree pointer is 6 bytes long and each data pointer is 7 bytes long. Find the order nleaf of B+-tree leaf nodes.

Write a C++ class implementing DOUBLE THREADED BINARY SEARCH TREE that supports the following operations: kthElement(k) -- finds the k-th largest element in the BST and prints the key value. Your code should run in O(h) time.   Note: It has be done using double threaded binary search tree. Please comment your code and share the screenshot of the output

Assume that disk block size is 1024 bytes. A B+-tree is created on an attribute of length 12 bytes. Each tree pointer is 6 bytes long and each data pointer is 7 bytes long. Find the order n of B+-tree nodes.

Create a binary linked tree, and traverse the tree by using the recursive function. The structure of the tree is as follows: //check pic//  You should input the nodes in pre-order sequence. If a child of a node is NULL, input a space. Write the function of create binary tree, pre-order to print the nodes, in-order to print the nodes and post-order to print the nodes. Count the height of the tree.   Hints: Header file typedef char ElemType;   typedef struct node//define the type of binary tree node {                                       }BTnode;       Source file #include <stdio.h> #include <stdlib.h> #include "tree.h"   BTnode * createTree()//create the binary tree，return the root {             BTnode *tnode;// tnode is the root             char elem;                                ;//input the character                            //if the input is a space，set the pointer as NULL               Else// if the input is not a space，generate the binary node and create its left…

In a binary search tree the following key values (not necessarily in the order given) are encountered while searching for the key 29. 3,7,13,19,37,43,51,59. The total number of possible orders in which the given keys of the binary search tree could have been visited is A. 60 B.70 C.50 D.80

In this question you are to write MIPS assembly language procedures insert and search for a quadtree data structure, and a main program to test them. Each node of the tree should be implemented with six consecutive words of memory, as shown below: x value y value NW child ptr NE child ptr SE child ptr SW child ptr address a address a+4 address a+8 address a+12 address a+16 address a+20 Each of the four child pointers (NW child ptr, NE child ptr, SE child ptr, and SW child ptr) gives the memory address of the first word of the corresponding child node. A pointer (memory address) value of zero indicates that there is no such child node. The tree nodes should be linked such that for a node with (integer) values (X,Y) all nodes in its NW subtree have x value less than or equal to X and y value greater than Y, all nodes in its NE subtree have x value greater than X and y value greater than or equal to Y, all nodes in its SE subtree have x value greater than or equal to X and y value less…

A binary search tree is a data structure that consists of JavaScript objects called "nodes". A tree always has a root node which holds its own integer value property and can have up to two child nodes (or leaf nodes), a left and right property. A leaf node holds a value attribute and, likewise, a left and right attribute each potentially pointing to another node in the binary tree. Think of it as a javascript object with potentially more sub-objects referenced by the left and right attributes. There are certain rules that apply to a binary tree: A node's left leaf node has a value that is <= than to its own value A node's right leaf node has a value that is => its own value. In other words: let node = { value: left: right: = this object's value> } You will be writing a function called isPresent that takes two arguments: the root object and a value (number), and returns a boolean true if the value is present in the tree or false if it is not present. function isPresent(root,…

Subject: Artificial Intelligence   Problem: Given the below tree please write your student number forward and backward as a utility function to the lowermost level ( ex: for student number 123456 you can see it on the tree) Tree is given the below. std_Number: 170493   a) apply alpha-beta pruning algorithm on the tree which you have created from your student number as a utility function. You can write the values in the ovals as propagate up through the tree. If you need to prune the branches please use (insert- shapes –line) to prune the branch/es. b-) if you would apply alpha-beta pruning from right to left on the above tree. Would your solution change? Explain your reason in one sentence please c-) In general, in a given any tree if you would apply alpha-beta pruning from right to left on the tree would your result change? Explain your reason in one sentence

Hello, I need help with coding a 4 level family tree in java. somehing like the following code. import java.util.Arrays;import javax.swing.JFrame;import com.mxgraph.layout.hierarchical.mxHierarchicalLayout;import com.mxgraph.swing.mxGraphComponent;import com.mxgraph.view.mxGraph;public class JGraphX2 extends JFrame{private static final long serialVersionUID = -2707712944901661771L;SimpleTreeNode<String> root = createSimpleTreeNode();public void fillGraphFromModel( mxGraph graph) {graphUpdate();Object parent = graph.getDefaultParent();graph.getModel().beginUpdate();try{Object vRoot = graph.insertVertex(parent, null, root.getData(), 80, 0, 80, 30);Object vChild1 = graph.insertVertex(parent, null,root.getChildren().get(0).getData() , 0, 0, 80, 30);Object vChild2 = graph.insertVertex(parent, null, root.getChildren().get(1).getData(), 0, 0, 80, 30);Object vChild3 = graph.insertVertex(parent, null, root.getChildren().get(2).getData(), 0, 0, 80, 30);Object vChild4 =…

Python code:   ##############################class Node:    def __init__(self,value):        self.left = None        self.right = None        self.val = value ###############################class BinarySearchTree:    def __init__(self):        self.root = None def print_tree(node):     if node == None:        return    print_tree(node.left)    print_tree(node.right)     print(node.val) ################################################## Task 1: get_nodes_in_range function#################################################  def get_nodes_in_range(node,min,max):     #     # your code goes here     #     pass # fix this if __name__ == '__main__':    BST = BinarySearchTree()    BST.root = Node(10)    BST.root.left = Node(5)    BST.root.right = Node(15)    BST.root.left.left = Node(2)    BST.root.left.right = Node(8)    BST.root.right.left = Node(12)    BST.root.right.right = Node(20)    BST.root.right.right.right = Node(25)     print(get_nodes_in_range(BST.root, 6, 20))

1)Create all red-black balanced search trees templates (structures) with a size of 6 (for letters from A to F) 2) Create all binary trees templates (structures) with a size of 4 (identify how many are distinct) 3)Create a binary tree for the sequence of letters: D E L T K Y N S A R C H. Draw the  tree. Delete the key A (show the tree obtained). Delete the key L  (show the tree obtained). Delete the key E (show the  tree obtained).

Please convert the code to C language   //separate chaining#include <bits/stdc++.h>using namespace std; class node {public:    int data;    node* next;     node()    {        data = 0;        next = NULL;    }    node(int x)    {        data = x;        next = NULL;    }}; node* add(node* head, int data){    if (head == NULL) {        head = new node(data);        return head;    }     node* temp = head;    while (temp->next) {        temp = temp->next;    }    temp->next = new node(data);    return head;} void print(node* head){     if (!head) {        cout << "NULL\n";        return;    }    node* temp = head;    while (temp) {        cout << temp->data << "->";        temp = temp->next;    }    cout << "NULL\n";} int main(){    //set of input numbers    vector<int> arr{ 123, 456, 763, 656, 908, 238, 231 };     //initialize the hash table    //each entry of the hash table is a linkedlist    vector<node*> hash(10); //size of…

What are some of the most frequent computer programmes that are used to solve the issue of the least spanning tree?

What should my code be to get the size of my six clusters  Here is my code so far  # Install necessary libraries import pandas as pd import numpy as np import seaborn as sbn from google.colab import files from sklearn.cluster import KMeans from sklearn.metrics import silhouette_score import matplotlib.pyplot as plt from scipy.stats import skew   # suppress scientific notation in later outputs pd.options.display.float_format = '{:.2f}'.format np.set_printoptions(suppress = True)   # load cluster data and remove any commas so we can process properly df = pd.read_csv('CC GENERAL.csv') df = df.replace(',','',regex = True)   #elbow graph to see how many cluster to do  elbow_kwargs =  {'init':'random', 'n_init':10, 'max_iter':480, 'random_state':48} sse = [] for x in range(1,15):     model_chk = KMeans(n_clusters = x, **elbow_kwargs)     model_chk.fit(df)     sse.append(model_chk.inertia_) plt.style.use('fivethirtyeight') plt.plot(range(1,15),sse) plt.xticks(range(1,15))…

Question No 5: HUFFMAN TREE                                                                                                                  Given Letters A, B, C, D, E with following frequencies.                                                             Frequency Table                         Character         Frequency       Huffman Codes                                     M                     20                   10                                     N                      11                   1110                                     O                      8                     1111                                     P                       12                   110                                     Q                      49                   0   A) Create a Single Huffman tree to determine the binary codes for each character. B) Fill the codes into the table above. C) Encode the following sequence MNOPQ.

Write a Java program to Construct a 2-3 tree with at last 10 key values, Search the particular key value present in the 2-3 tree or not and finally Delete any one leaf node which has single key value.

For the following use the method of "primitive counting" described in class:   Turn the following into the appropriate string of 1s and 0s by drawing the appropriate ternary tree:   32 63 97   Turn the following strings of 1s and 0s into the appropriate number of sheep, drawing the ternary tree is desired:   1,0,1,0,1,0 1,0,1,0,1,0,1 1,0,1,1,0,0,0,1