Write a C++ code to insert the following numbers in two Binary Search Trees. Insert numbers of first list in Binary Search Tree#1, and numbers of second list in Binary Search Tree#2. Do not insert both lists in a single Binary Search Tree. List#1. 5, 78, 45, 23, 11, 89, 10, 78, 6, 99, 876, 5, 67, 13 List#2. 5, 89, 688, 52, 557, 953, 5, 7, 55, 35, 89, 99, 99, 6, 557, 89, 5, 99, 6, 2, 45, 12, 7, 6, 94, 93, 99, 67 (a) After inserting numbers in Binary Search Trees. Write a function to print only those numbers that appear in List#1 and more than 2 times in List#2. (b) For example, the number “5" appears in List#1 and 3 times in List#2. So your code should print "5" and similar other numbers.

Write a C++ code to insert the following numbers in two Binary Search Trees. Insert numbers of first list in Binary Search Tree#1, and numbers of second list in Binary Search Tree#2. Do not insert both lists in a single Binary Search Tree. List#1. 5, 78, 45, 23, 11, 89, 10, 78, 6, 99, 876, 5, 67, 13 List#2. 5, 89, 688, 52, 557, 953, 5, 7, 55, 35, 89, 99, 99, 6, 557, 89, 5, 99, 6, 2, 45, 12, 7, 6, 94, 93, 99, 67 (a) After inserting numbers in Binary Search Trees. Write a function to print only those numbers that appear in List#1 and more than 2 times in List#2. (b) For example, the number “5" appears in List#1 and 3 times in List#2. So your code should print "5" and similar other numbers.

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

Write a C++ code to insert the following information in the Binary Search Tree? {Paris, London, Dubai, Muscat, Riyadh, Berlin, Amsterdam, Sydney, Stockholm, Oslo} After insertion, print all names of binary search tree using cout statement.
PLEASE WRITE IN C++ Implement a program that uses an array based binary tree (sequential tree) that has a menu with these options: 1.) insert (This option asks the user for a size and then creates the array based tree, filling the tree with characters or integers . Fill the sequential tree as a complete tree and insert keys as children to specific parents, It is also straightforward to insert children to specific parents due to the fixed nature of the parent child relationship, with a parent having children at indexes ( 2 * Parent index ) + 1, and + 2.). 2.) search (asks user for a character to search in the tree then prints if it is in the tree or not.) 3.) quit (exits program)
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; };
write a function in python that recieves the reference to the root (t) of a binary search tree and returns a listcontaining the keys in the path from the root of (t) to the largest key in (t). The function must use recursion Starting code: def path_to_largest(t): return [t.key]
Write a C++ code to insert the following numbers in two Binary Search Trees. Insertnumbers of first list in Binary Search Tree#1, and numbers of second list in BinarySearch Tree#2. Do not insert numbers of both lists in a single Binary Search Tree. List#1.5, 78, 45, 23, 11, 89, 10, 78, 6, 99, 876, 5, 67, 13List#2.5, 89, 688, 52, 557, 953, 7, 55, 35, 89, 99, 99, 6, 557, 89, 5, 99, 2, 45, 12, 7, 6, 94,93, 99, 67 (a) After inserting numbers in both Binary Search Trees. Write a function to printonly those numbers that appear either in List#1 or List#2 but not in other list. (b) For example, your code should print “78” because it appears in List#1 but notin List#2. Also you code should print “2” because it appears in List#2 but notin List#1.
Can help in Java? Qustion : Using Binary search tree write a Java program to Insert and print the element in (in-Order traversal ), then search the elements (a and z) in the tree… provided that user enters the values.
in C++, create a binary search tree class using the class templatr below. class BinarySearchTree{ public:BinarySearchTree(); ~BinarySearchTree(); const int & findMin() const; const int & findMax() const; bool contains(cons tint &x) const; bool isEmpty(); void insert(const int &x); void remove(const int &x); private: struct BinaryNode{ int element; BinaryNode *left; BinaryNode *right; BinaryNode(const int &el, BinaryNode *lt, BinaryNode *rt) :element(el), left(lt), right(rt){} }; BinaryNode *root; void insert(const int &x, BinaryNode *&t) const; void remove(const int &x, BinaryNode *&t) const; BinaryNode * findMin(BinaryNode *t) const; BinaryNode * findMax(BinaryNode *t) const; bool contains(cons tint &x, BinaryNode *t) const; };
python: In a binary search tree, write another way of function that takes in a root, p, and checks whether the tree rooted in p is a binary search tree or not. What is the time complexity of your function? def is_bst(self, p): root=p def helper(root, l, r): if not root: return True if not (left<root.val and root.val<right): return False return helper(root.l, l, root.val) and helper(root.r, root.val, r) return helper(root, float('-inf'), float('inf'))
Given a number and a sorted binary tree, write function that inserts the number into the tree. Given a list of numbers, write a function that inserts each number into the tree. Given a sorted tree, write a function that creates a sorted list.
The code below is for: (Programming language is C) a. Create a sorted linked list using tenStudent array (copy from array into the linked list will be done). b. Append an element to the end of a list c. Delete the last element from a list. d. Delete the nth element from a list. >>>>>>>>>>>>>>>>>>>>>>>>>> I need to complete the code to do : 1. Using the linked list which is populated at step a, Create a binary tree. The new tree will be created during the deletion of the linked list. The rest of question details in picture.. (Programming language is C) .. thank you The Code: #include<stdio.h>#include<stdlib.h> struct student{int TC;char F_name[12];char L_name[12];int age;char gender[2];};struct student tenStudent[10] =…
I need help with coding in C++ please: Write a program (in main.cpp) to do the following: a. Build a binary search tree T1. b. Do a postorder traversal of T1 and, while doing the postorder traversal, insert the nodes into a second binary search tree T2 . c. Do a preorder traversal of T2 and, while doing the preorder traversal, insert the node into a third binary search tree T3. d. Do an inorder traversal of T3. e. Output the heights and the number of leaves in each of the three binary search trees. The program should accept input and produce output similar to the example below: Enter numbers ending with -999: 10 5 7 -999 tree1 nodes in postorder: 7 5 10 tree2 nodes in preorder: 7 5 10 tree3 nodes in inorder: 5 7 10 tree1 height: 3 tree1 leaves: 1 tree2 height: 2 tree2 leaves: 2 tree3 height: 2 tree3 leaves: 2 The program has 3 tabs: main.cpp , binarysearchTree.h , and binaryTree.h
in c++, write a function to find the height of a specific node in a Binary Search Tree.