In C++ Please Write a struct Student that has member variables: (string) first name, (int) age and (double) fee. Implement the Splay tree whose each node has data component an instance of the struct Student. Comparison of the nodes must be made with respect to age. Write the following functions along with necessary functions to: (i) search elements in the tree; (ii) insert nodes in the tree; (iii) print the tree in pre-order traversal fashion; (iv) delete a node from the tree; Implement the following (you can hardcode the inputs): (i) insert seven elements in the tree: (Kabeer, 19, 35.17), (John, 21, 31.65), (Paul, 25, 33.43), (Kaur, 18, 34.93), (Patel, 23, 36.37), (Alexander, 22, 33.78), (Ramesh, 27, 34.46); (ii) print the tree in pre-order fashion; (iii) delete an element from the tree (John, 21, 31.65); (iv) search an element (Alexander, 22, 33.78) in the tree; (v) print the tree in pre-order traversal fashion;

In C++ Please Write a struct Student that has member variables: (string) first name, (int) age and (double) fee. Implement the Splay tree whose each node has data component an instance of the struct Student. Comparison of the nodes must be made with respect to age. Write the following functions along with necessary functions to: (i) search elements in the tree; (ii) insert nodes in the tree; (iii) print the tree in pre-order traversal fashion; (iv) delete a node from the tree; Implement the following (you can hardcode the inputs): (i) insert seven elements in the tree: (Kabeer, 19, 35.17), (John, 21, 31.65), (Paul, 25, 33.43), (Kaur, 18, 34.93), (Patel, 23, 36.37), (Alexander, 22, 33.78), (Ramesh, 27, 34.46); (ii) print the tree in pre-order fashion; (iii) delete an element from the tree (John, 21, 31.65); (iv) search an element (Alexander, 22, 33.78) in the tree; (v) print the tree in pre-order traversal fashion;

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 9PE

See similar textbooks

Similar questions

A tree is implemented using a node structure defined as: struct node{ int data; struct node *left; strict node *right; }; Write a function whose prototype is: int smallest(struct node *); which accepts a tree (pointer to the root) and returns the smallest node in the right sub-tree of the root. If root is NULL, or if there is no right sub-tree, returm the number -999.
A BST is constructed in the usual way using the node definition below. Write a function int child2( bst node t *curr) that returns the number of nodes that have 2 children. typedef struct BST NODE T {int data;struct BST NODE T *left, *right; } bst node t; int child2( bst node t *curr){ }
Write the following function: The function gets a root of a Binary Tree of ints, and a function f. it applies f to the data of each node in the tree. // applies f to each node of the tree under root void map(BTnode_t* root, int (*f)(int)); struct BTnode { int value; struct BTnode*left; struct BTnode*right; struct BTnode*parent; }; typedef struct BTnode BTnode_t; BTNODE.C: BTnode_t* create_node(int val) { BTnode_t* newNode = (BTnode_t*) malloc(sizeof(BTnode_t)); newNode->value = val; newNode->left = NULL; newNode->right = NULL; newNode->parent = NULL; returnnewNode; } void set_left_child(BTnode_t* parent, BTnode_t* left_child) { if (parent) parent->left = left_child; if (left_child) left_child->parent = parent; } void set_right_child(BTnode_t* parent, BTnode_t* right_child) { if (parent) parent->right = right_child; if (right_child) right_child->parent = parent; } void print_pre_order(BTnode_t* root) { if (root == NULL) return; printf("%d ",…
Programming questions：typedef struct node { int data; struct node *left, *right;}BT;The node structure of the binary tree (BT) is shown above. There is a binary tree T, please complete the function: int degreeone(BT *T) to compute how many degree 1 node in the BT. The T is the root pointer, and the function shoule return the total number of degree 1 node.
C++ PROGRAMMINGTopic: Binary Search Trees Explain the c++ code below.: It doesn't have to be long, as long as you explain what the important parts of the code do. (The code is already implemented and correct, only the explanation needed) node* left(node* p) { return p->left; } node* right(node* p) { return p->right; } node* sibling(node* p){ if(p != root){ node* P = p->parent; if(left(P) != NULL && right(P) != NULL){ if(left(P) == p){ return right(P); } return left(P); } } return NULL; } node* addRoot(int e) { if(size != 0){ cout<<"Error"<<endl; return NULL; } root = create_node(e,NULL); size++; return root; } node* addLeft(node* p, int e) { if(p->left == NULL){ node* newLeft =…
Computer Science Exercise: shape [★★★] Write a function same_shape : 'a tree -> 'b tree -> bool that determines whether two trees have the same shape, regardless of whether the values they carry at each node are the same. Hint: use a pattern match with three branches, where the expression being matched is a pair of trees. please use Ocaml for the coding
please give a correct c++ code Write a struct Student that has member variables: (string) first name, (int) age and (double) fee. Implement the Splay tree whose each node has data component an instance of the struct Student. Comparison of the nodes must be made with respect to age. Write the following functions along with necessary functions to: (i) search elements in the tree; (ii) insert nodes in the tree; (iii) print the tree in pre-order traversal fashion; (iv) delete a node from the tree; Implement the following (you can hardcode the inputs): (i) insert seven elements in the tree: (Kabeer, 19, 35.17), (John, 21, 31.65), (Paul, 25, 33.43), (Kaur, 18, 34.93), (Patel, 23, 36.37), (Alexander, 22, 33.78), (Ramesh, 27, 34.46); (ii) print the tree in pre-order fashion; (iii) delete an element from the tree (John, 21, 31.65); (iv) search an element (Alexander, 22, 33.78) in the tree; (v) print the tree in pre-order traversal fashion;
Write a function same_shape : 'a tree -> 'b tree -> bool that determines whether two trees have the same shape, regardless of whether the values they carry at each node are the same. Hint: use a pattern match with three branches, where the expression being matched is a pair of trees.
C++ please Please complete Programming Exercise 4, from pages 1402, from chapter 19 from your textbook. Write a function, singleParent, that returns the number of nodes in abinary tree that have only one child. Add this function to the classbinaryTreeType and create a program to test this function. (Note: Firstcreate a binary search tree.)
in c++, write a function to find the height of a specific node in a Binary Search Tree.
Implement the following search strategies using C programming. You may use tree, queue and stack structures in your implementation. a) BFS b) UCS c) DFS Use the following map as sample and place it in your tree: B 3 3 A D 2 12
Write a C++ class called BSTArray with five basic functions for the BST: insert, search, findmin, findmax, and print: 1. int search(x): Find and return the index that stores element x using binary search tree mechanism. Print out all the elements in the search path. You must use the binary tree search algorithm. In other words, do NOT just do a linear search of the array. If the x value is not found, report an error and return -1. 2. int findmax( ): Find and return maximum value in BST. You must use the binary tree search algorithm. In other words, do NOT just perform a linear search of the array. If the tree is empty, return -1. 3. int findmin( ): Find and return minimum value in BST. In other words, do NOT just perform a linear search of the array. If the tree is empty, return -1. 4. void print( ): Print out the BST structure in the form of an array with index. Specifically, print the index of the array and the value stored at that index starting at zero and ending at the capacity of…