void doo(list &L){int item,a,p=L.size()-1; L.retrieve(p,a);for(int i=0;i int doo(node*root){if(root==0 ) return 0;if(root->left==0 && root->right==0) return root->data;return doo(root->left) + doo(root->right);}This code findsO a. the sum of leaves items in a binary treeO b. The minimum item in a binary search treeO c. the number of leaves in a binary treeO d. the maximum item in a binary search tree

First of all let's understand what is list: Lists are sequence containers that allow non-contiguous…

Answered: void doo(list &L){ int…

Engineering

Computer Science

void doo(list &L){ int item,a,p=L.size0-1; L.retrieve(p,a); for(int i=0;i

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Java Programming Exercise 2 Another co-worker emails you and said she developed a recursive version for doing search in a binary search tree. Here’s the code for the function: public boolean searchRecursive(Node current, int searchValue) { if (current.data == searchValue) return true; else if (current == null) return false; else if (current.data > searchValue) return searchRecursive(current.left, searchValue); else return searchRecursive(current.right, searchValue); } She says that she “keeps getting an error” but unfortunately did not say if it was a compile error or a run-time error (or both). You analyze the code and see there is indeed an error and so you reply with the following: Draw a picture of what a binary search tree would look like after inserting values of 5, 10, 8, 15, 4, 2, and 3 in that order Next, tell her why she gets either a compile time error or run-time error (or both) and…
In c++ pleaseeee please donot copy from internet and also add comments to each line explaining the code A company wants to store his Employees data but orderly. Because of that owner wants to use a binary search tree. Each Node must store the employee number, name, and salary double (class). Implement in java/C++ a binary search tree that stores the employees and implements the following methods: a) Include a new Employee (insert values) b) Search an employee given its number. c) Delete an employee. d) Get in-order, pre-order, post-order traversal of tree and display values.
I need help coding an ordinary BST data structure in Java from scratch without using BST library package. The coded BST should be able to do the following operations- *create() – produces an empty BST *search() – determines if a search key exists in the BST *insert() – adds a new node in the BST *destroy() – The BST will become empty after calling destroy(). Note this BST is mainly for string keys and not integers
Book{ AvlNode{ AvlTree{String title Book insert()int ID int height printTree()String author AvlNode left height()double price AvlNode right max()} } }From your understanding of AVL trees, implement the four different types of rotations and node swoping inside AvlTree.java; each question must be completed with inline Javadoc and/or comments:1. rotRight(AvlNode someNode) and returns AvlNode.2. rotLeft(AvlNode someNode) and returns AvlNode.3. doubleRotLeft(AvlNode someNode) and returns AvlNode. 4. doubleRotRight(AvlNode someNode) and returns AvlNode. 5. Complete a driver code under the main method
CODE needs to be written in c++ 1.- Construct the below tree using the below node class 2.- Save the tree on a txt file using recursive function that takes an ofstream and a node pointer. Write the file using a pre-order traversal, following the below format (where leaves are denoted by #A, and nodes #Q ) #Q Is it a mammal? #Q Does it have stripes? #A Is it a zebra? #A Is it a lion? #Q Is it a bird? #Q Does it fly? #A Is it an eagle? #A Is it a penguin? #A Is it a gila monster? class node { public: string data; node* left; node* right; };
in java : you need to start implementing a class for creating and storing Binary SearchTrees (BST). Each node of this BST will store the roll number, name and CGPA of a student.The class definitions will look like:class StudentBST;class StudentNode {friend class StudentBST;private:int rollNo;string name;Student’s CGPAStudentNode* left; // Pointer to the left subtree of a nodeStudentNode* right; // Pointer to the right subtree of a node};class StudentBST {private:StudentNode* root; // Pointer to the root node of the treepublic:StudentBST(); // Default constructor}; Write a menu-based driver function to illustrate the working of different functions of theStudentBST class. The menu should look like:1. Insert a new student2. Search for a student3. See the list of students4. QuitEnter your choice:
Language C++: Kill Monger Suppose you are playing a killing game and have to kill few of your enemies. You are at acliff and from there you can see few of them. You see the enemies at your height only.Therefore, you can only kill at the same height. The enemies are forming a balanced binarytree where their General is at the top of the other cliff, his two commanders are on the firstlevel below him. The soldiers are at the lowest level. Total four soldiers are appointed. Underboth the commanders exact two soldiers serve.You have to make a strategy to kill the left commander first, than whoever takes his positionkill him. Now start killing the right side with same strategy until only one enemy is left at leftside. Now increase your height and kill the General. You can only win if only three of yourenemies are left.Display the enemies who are left and who have been killed. Don’t forget to print your victorymessage.HINT: Balancing is the key to achieve your goal.
I'm looking over my code for my tree and I keep receiving segmentation faults when I try to add or search for value in the tree. Is there something that I am missing in my addNode or newNode function? #include <stdio.h>#include <stdlib.h> // Austin Chong// The core concept of this assignment is to use and create a BST in a C Program.// 7 April 2020 struct node{int data;struct node *left;struct node *right;}; struct node *newNode(int data){struct node *temp = (struct node*)malloc(sizeof(struct node));temp -> data = data;temp -> left = NULL;temp -> right = NULL;return temp;} struct node *addNode(struct node* node, int data){if(node == NULL){return newNode(data);} if(data < node -> data){node -> left = addNode(node -> left, data);} else {node -> right = addNode(node -> right, data);}return node;} void findData(struct node *node, int value){if(node -> left == NULL && node -> right == NULL && node -> data != value)…
Complete the following function where a node is perculated through a MaxHeap when given the value of the parent node (through the use of a linked list) void BinMaxHeap::percolateUp(BHNode *p) { }
In c++ A company wants to store his Employees data but orderly. Because of that owner wants to use a binary search tree. Each Node must store the employee number, name, and salary double (class). Implement in java/C++ a binary search tree that stores the employees and implements the following methods: a) Include a new Employee (insert values) b) Search an employee given its number. c) Delete an employee. d) Get in-order, pre-order, post-order traversal of tree and display values.
Find the max and min value, please use this BTS Code. ... class BinarySearchTreeNode: def __init__(self, data): self.data = data self.left = None self.right = None def add_child(self, data): if data == self.data: return # node already exist if data < self.data: if self.left: self.left.add_child(data) else: self.left = BinarySearchTreeNode(data) else: if self.right: self.right.add_child(data) else: self.right = BinarySearchTreeNode(data) def build_tree(elements): print("Building tree with these elements:",elements) root = BinarySearchTreeNode(elements[0]) for i in range(1,len(elements)): root.add_child(elements[i]) return root if __name__ == '__main__': numbers_tree = build_tree([17, 4, 1, 20, 9, 23, 18, 34])
Write a recursive function called "GetParent" in Binary Search Tree of the given node. You can take as many arguments as you like. Use the following structure definition. struct TNode{ char NodeName[10]; TNode *LeftT, *RightT; } root;