Assume we have an IntBST class, which implements a binary search tree of integers. The field of the class is a Node variable called root that refers to the root element of the tree. 1) Write a recursive method for this class that computes and returns the sum of all integers less than the root element. Assume the tree is not empty and there is at least one element less than the root. 2) Write a recursive method that prints all of the leaves, and only the leaves, of a binary search tree. 3) Write a method, using recursion or a loop, that returns the smallest element in the tree.

Assume we have an IntBST class, which implements a binary search tree of integers. The field of the class is a Node variable called root that refers to the root element of the tree. 1) Write a recursive method for this class that computes and returns the sum of all integers less than the root element. Assume the tree is not empty and there is at least one element less than the root. 2) Write a recursive method that prints all of the leaves, and only the leaves, of a binary search tree. 3) Write a method, using recursion or a loop, that returns the smallest element in the tree.

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

using binary trees and C++
IN C++ The input to the problem is a collection of n points in the plane. The points have int values.The goal of the traveling salesperson problem is to find the shortest path that visits every point exactly once and returns to the starting point. That is, we are looking for a cycle in the graph that visits each vertex exactly once, such that the total length is as small as possible. Storing the points:You will need to write a class that stores a collection of points. You may use any data structure you want to do it (array, linked list or vector in C++) Print the list of points:Your solution should have a method that prints the list of all points. Your solution should have a method that draws the points on the screen. You will need to implement a heuristic algorithm that finds a solution to the TSP problem
java programming Write two methods in the Java programming language, the first using recursion to find the smallest item in the list and the second the largest. Name the methods appropriately. class OurList{ int head; OurList tail; //methods }
24. Add the following new method in the BST class. /** Returns the number of nodes in this binary tree */ public int getNumberofNodes () Requirements: a. Don't use return size; b.write a recursive method that returns the number of nodes starting from www the root.
10. Given the definition of a binary tree Node, write a method that returns the height ofa given node.Class TreeNode {Int value;TreeNode left;TreeNode right;}Static int height (TreeNode position) { }** Use only the definition of a TreeNode, don’t suppose we have other built-inmethods.
class Queue { private static int front, rear, capacity; private static int queue[]; Queue(int c) { front = rear = 0; capacity = c; queue = new int[capacity]; } static void queueEnqueue(int data) { if (capacity == rear) { System.out.printf("\nQueue is full\n"); return; } else { queue[rear] = data; rear++; } return; } static void queueDequeue() { if (front == rear) { System.out.printf("\nQueue is empty\n"); return; } else { for (int i = 0; i < rear - 1; i++) { queue[i] = queue[i + 1]; } if (rear < capacity) queue[rear] = 0; rear--; } return; } static void queueDisplay() { int i; if (front == rear) { System.out.printf("\nQueue is Empty\n"); return; } for (i = front; i < rear; i++) { System.out.printf(" %d <-- ", queue[i]); } return; } static void queueFront() { if (front == rear) { System.out.printf("\nQueue is Empty\n"); return; } System.out.printf("\nFront Element is: %d", queue[front]);…
2) Suppose you have a linked list class that provides the following methods: // constructor. // returns size of the list. LinkList () int size (); void insertHead (Object data) // insert new data at the head of // the list. // remove and return the Object at // the head of the list. Object removeHead () void insertTail (Object data) // insert new data at the tail of // the list. The class below is an implementation of a stack using the linked list class. Fill in the method implementations: class Stack { private Stack s; public Stack () { public void push (Object x) { } public Object pop () // assume stack is not empty { } public boolean isEmpty() { }
boɔ ypleð The following code shows how one might implement a binary tree node: public class TreeNode ( public int data; public TreeNode left; public TreeNode right; public TreeNode(int d, TreeNode 1, TreeNode r) { data = d; left - 1; right = r; Suppose we have the following binary tree (with root being the node at the top): 7 The following method is an instance method in the TreeNode class. public int c() { int leftc = 0; if (left != null) { leftc - left.c (); int rightc - 0; if (right != nul1) { rightC = right.c(); return leftc + rightC + 1; Suppose root.c() is called. What is returned? Show memory diagrams and/or stack frames to explain what the recursive calls are.
19- java. Which of the following is a drawback of using recursion? It may be less efficient than an iterative version. It may have fewer lines of code than an iterative version. It uses lesser memory stack than an iterative version. It runs faster than an iterative version.
Program in Haskell (Replace the question marks with code). Has to be recursive: my_map :: (a -> b) -> [a] -> [b] my_map = ? my_all :: (a -> Bool) -> [a] -> Bool my_all = ? my_any :: (a -> Bool) -> [a] -> Bool my_any = ? my_filter :: (a -> Bool) -> [a] -> [a] my_filter = ? my_dropWhile :: (a -> Bool) -> [a] -> [a] my_dropWhile = ? my_takeWhile :: (a -> Bool) -> [a] -> [a] my_takeWhile = ? my_break :: (a -> Bool) -> [a] -> ([a], [a]) my_break = ? -- Implement the Prelude functions and, or, concat using foldr my_and :: [Bool] -> Bool my_and = ? my_or :: [Bool] -> Bool my_or = ? my_concat :: [[a]] -> [a] my_concat = ? -- Implement the functions sum, product, reverse using foldl my_sum :: Num a => [a] -> a my_sum = ? my_product :: Num a => [a] -> a my_product = ? my_reverse :: [a] -> [a] my_reverse = ?
5- Write an efficient java method that computes and returns the height from node t in a btree of any degree. . Please write proper comments in your java code. Your java code should not read or print anything. Assume btree node is defined as follow: private class node{ int count, data(); node parent, link[]:} // end class node private int height(node t){
package circularlinkedlist;import java.util.Iterator; public class CircularLinkedList<E> implements Iterable<E> { // Your variablesNode<E> head;Node<E> tail;int size; // BE SURE TO KEEP TRACK OF THE SIZE // implement this constructorpublic CircularLinkedList() {} // I highly recommend using this helper method// Return Node<E> found at the specified index// be sure to handle out of bounds casesprivate Node<E> getNode(int index ) { return null;} // attach a node to the end of the listpublic boolean add(E item) {this.add(size,item);return false; } // Cases to handle// out of bounds// adding to empty list// adding to front// adding to "end"// adding anywhere else// REMEMBER TO INCREMENT THE SIZEpublic void add(int index, E item){ } // remove must handle the following cases// out of bounds// removing the only thing in the list// removing the first thing in the list (need to adjust the last thing in the list to point to the beginning)// removing the last…