To class Tree that represents binary search tree (BST), add the following method: 1- printByLevel () which prints the nodes in the tree level by level, it prints all nodes in a specific level before moving to the nodes at the next depth level. For example this tree should be printed as follows: 11 6 19 4 8 17 43 5 10 31 49 Hint: you need to use a queue. 2- nodesInLevel(int x): it returns number of nodes in a specific level x. for example in this tree, nodesInLevel(2) is 4 Hint: this method should call a recursive method. 3- iterativelnOrder : it prints all nodes using in-order approach without using recursion. Hint: you need to use a stack. 4- ancestors( int k): it prints all ancestor of the node with key k starting by the parent toward the root. Hint: you need to use a stack

To class Tree that represents binary search tree (BST), add the following method: 1- printByLevel () which prints the nodes in the tree level by level, it prints all nodes in a specific level before moving to the nodes at the next depth level. For example this tree should be printed as follows: 11 6 19 4 8 17 43 5 10 31 49 Hint: you need to use a queue. 2- nodesInLevel(int x): it returns number of nodes in a specific level x. for example in this tree, nodesInLevel(2) is 4 Hint: this method should call a recursive method. 3- iterativelnOrder : it prints all nodes using in-order approach without using recursion. Hint: you need to use a stack. 4- ancestors( int k): it prints all ancestor of the node with key k starting by the parent toward the root. Hint: you need to use a stack

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

Extend program BinarySearchTree.java by adding the following operations to the BinarySearchTree class: a. Find the height of the BST. b. Find node with the largest key. c. Find the average of the key values of the nodes. d. Print the nodes in the tree in pre-order, in-order, and post-order. (decided by the user after run) e. Create the same BST shown in question 2. Run your program for the BST shown in question 1 to its final state and output the height, the largest key, and average of the keys. import java.util.*; public class BinarySearchTree1{ public Node root; public BinarySearchTree1() { root = null; } public Node getroot() { return root; } public Node Search(int KEY) { Node x = root; while (x != null && x.item != KEY) { if (KEY < x.item) { x = x.Left; } else { x =…
Write a function, singleParentWithLeftChild, that returns the number of nodes in a binary tree (pointed by p) that have only one left child. Your program should NOT count the nodes with one right child. (30 point) // find the number of singles parent nodes in a binary subtree pointed by p int BST::singleParentWithLeftChild(TreeNode* p) { // write your code here! }
Java Programming Language Create a class that accepts id numbers ranging from 1 to 29. The id numbers are nodes of a binary tree. Traverse the tree in inorder, preorder, and postorder and display the traversed values.
In C++, develop an algorithm that inserts the value val into a binary search tree with root. If the tree is empty, root = null. The algorithm returns the root of the tree containing the added item. You should assume that “new node” creates a new node with data field data and reference fields left (for left child) and right (for right child).
Attached is an image of a binary tree: Write the order of the nodes visited in: An in-order traversal: A pre-order traversal: A post-order traversal: What is the height of the above binary tree?
Explore ways to perform a Level Order Traversal on aBinary Tree.Implement this design using the DequeThe root element of the binary tree is given to you. Your task is to returnthe level order traversal of the Binary Tree’s nodes’ values – from left to right,level by level.# Class to represent Tree nodeclass Node:# A function to create a new nodedef __init__(self, key):self.data = keyself.left = Noneself.right = NoneBelow is an illustrated sample of Binary Tree nodes for your reference, whichin-fact is the same example we discussed in the lecture.root = Node(4)root.left = Node(2)root.right = Node(6)root.left.left = Node(1)root.left.right = Node(3)root.right.left = Node(5)root.right.right = Node(7)Your code will need to return all the nodes of the Binary Tree in Level OrderTraversal fashion - from left to right. That is: 4 2 6 1 3 5 7Level Order Tree Traversal with the help of the Queue data-structure shouldmeet the following complexities as stated below.Time Complexity: O(n)Space…
Implement a tree using a doubly linked list. Each node in the linked list would be of type“struct/class” and has the following declaration: struct/class Student {Student * left;Student * right;int marks;string name;}; You have to implement the following functions for the tree:1) InsertThis function will add a new student within the tree structure. Ask the user for studentname and marks.2) DisplayThis function will print data of all students in the tree structure (use any traversal method).3)SortingThis function will sort the students within the tree structure based on marks. NOTE:DO IN C++
In DrRacket: Define the difference between Binary Search Trees and Nodes? A) A Binary Search Tree is a Node, but a Node isn’t always a Binary Search Tree. B) A Node is a Binary Search Tree, but a Binary Search Tree isn’t always a Node. C) Binary Search Trees may contain Nodes, but Nodes cannot contain Binary Search Trees. D) Nodes may contain Binary Search Trees, but Binary Search Trees cannot contain Nodes. E) They are the same thing
Extend program BinarySearchTree.java by adding the following operations to the BinarySearchTree class: Show the results. a. Find the height of the BST. b. Find node with the largest key. c. Find the average of the key values of the nodes. d. Print the nodes in the tree in pre-order, in-order, and post-order. (decided by the user after run) e. Create the same BST shown in question 2. Run your program for the BST shown in question 1 to its final state and output the height, the largest key, and average of the keys. import java.util.*; public class BinarySearchTree1{ public Node root; public BinarySearchTree1() { root = null; } public Node getroot() { return root; } public Node Search(int KEY) { Node x = root; while (x != null && x.item != KEY) { if (KEY < x.item) { x = x.Left; } else {…
PLease help. Java Yatin is playing PUBG and he has reached a place with a large staircase in front of him.And there is an enemy at each landing of the staircase.This is not the actual staircase. He is looking at the staircase from sideways.The staircase is analogous to a binary tree with each of its nodes as a landing of thestaircase and each of its edges as stairs from one landing to another.Yatin wants to kill the maximum possible number of enemies. He can kill every personhe can see from his position with his suppressed sniper gun. But he can see only thepersons at the leftmost standing at each level and cannot see the rest.Before starting shooting them, he wants to know how many persons he can kill. He isbusy keeping an eye on the enemies. So he wants you to find out the maximum numberof people he can kill from that location by providing you with the analogous a binarysearch tree.[ Note: Players do not change their position after one player has died, i.e. the leftmostnode remains…
Given the following binary tree in the picture (where nullptr height == -1):A. What is the height of the tree?B. What is the depth of node 90?C. What is the height of node 90?D. Give the pre-order, in-order, and post-order traversal of this tree
Question 9 The number of different binary trees that can be made from 2 nodes that contain the key values 3 and 6 is 2. True False Question 10 Suppose xOrder is one of our binary search tree traversal methods that is passed a tree node, node, and a queue, q. Which traversal order is provided by the following code? xOrder(node.getLeft(), q); xOrder(node.getRight(), q); q.enqueue(node.getInfo()); preorder levelorder inorder postorder None of these is correct.