Write the definition of a (recursive) member function of the `BinarySearchTree` class named `countGreaterThan` that takes a parameter `n` of type `elemType` and returns the number of nodes whose `data` field is greater than parameter `n`. ```cpp// BinaryTree.h#include using namespace std;// Definition of the Nodetemplate struct TreeNode { elemType data; TreeNode *left; TreeNode *right;};// Definition of class Binary Treetemplate class BinaryTree {protected: TreeNode *root;public: BinaryTree(); BinaryTree(const BinaryTree& otherTree); ~BinaryTree(); bool isEmpty() const; virtual bool search(const elemType& searchItem) const = 0; virtual void insert(const elemType& insertItem) = 0; virtual void deleteNode(const elemType& deleteItem) = 0;private: int height(TreeNode *p) const; int nodeCount(TreeNode *p) const; int leafCount(TreeNode *p) const;};// BinarySearchTree.h#include "BinaryTree.h"using namespace std;template class BinarySearchTree: public BinaryTree {public: bool search(const elemType& searchItem) const; void insert(const elemType& insertItem); void deleteNode(const elemType& deleteItem);private: void displayAscending(TreeNode *p) const; TreeNode * getTreeMax(TreeNode *p) const; TreeNode * getTreeMin(TreeNode *p) const;};```### ExplanationThis code represents the class specifications for a `BinaryTree` class and a `BinarySearchTree` class in C++. These classes are for managing binary trees and binary search trees, respectively.- **TreeNode Structure**: This template structure holds the data for each node and pointers to left and right child nodes.- **BinaryTree Class**: - Inherits the `TreeNode` structure. - Protected member `root` points to the root of the tree. - Public member functions include constructors, destructors, and methods to check if the tree is empty, search, insert, and delete nodes. - Private member functions calculate the height, the number of nodes, and the number of leaf nodes.- **BinarySearchTree Class**:

Write the definition of a (recursive) member function of the BinarySearch Tree class named countGreaterThan that takes a parameter n of type elemType and returns the number of nodes whose data field is greater than parameter n. Edit Format Table 12pt v Paragraph v |BIUA

Write the definition of a (recursive) member function of the BinarySearch Tree class named countGreaterThan that takes a parameter n of type elemType and returns the number of nodes whose data field is greater than parameter n. Edit Format Table 12pt v Paragraph v |BIUA

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

Related questions

Q: USING C++ CODE THIS OUTPUT

A: PROGRAM INTRODUCTION: Include the required header files. Create the structure of the node for…

Q: The tree pointer is the first node of the binary tree and has both data and two reference links.…

A: The first node of the tree is called the root.

Q: Based on the non-recursive algorithm, implement the binary tree first order traversal, middle order…

A: Inorder (middle order) The obvious approach to navigating a tree without recursion is to use a…

Q: Write a function that creates a binary search tree from elements in a given sequence. Function must…

A: Function to implement Binary Search Tree. Since you are not specified any language of…

Q: without changing the driver program (main) do the following: Implement the member function…

A: without changing the driver program (main) do the following: Implement the member function…

Q: void F(node&*root){if(root!=0){F(root->left); F(root->right); root->data=0; delete root;}root=0;}…

A: Given: void F(node<int>&*root) { if(root!=0) { F(root->left); F(root->right);…

Q: Create a function that takes an array that represent a Binary Tree and a value and return true if…

A: In this problem, we need to design the code in javascript programming. Logic - if (tree ===…

Q: Write the C++ code for a function that takes the vector representation of a complete binary tree and…

A: Here have to determine about maxheap or not of vector representation.

Q: The data types of binary tree are defined as follows. Write a recursive function “int CounDegreeTwo(…

A: Recursive function to find no. of leaf nodes Recursive function “int CountLeaf(BiTree t)” which…

Q: Postorder traversal of binary tree is 4 5 2 3 1

A: Ans : Code: #include <iostream>using namespace std; // Data structure to store a binary tree…

Q: Write the definition of a (recursive) member function of the BinarySearchTree class named…

A: // C++ program to find number of nodes // greater than x #include <bits/stdc++.h> using…

Q: A binary search tree can be used to store arithmetic expressions. Change the BinarySearchTree class…

A: The operands (numbers) and operators (+, -, *, /) that specify the mathematical operations to be…

Q: True or false: A full tree expressed as an array needs around three times less space than a linked…

A: Tree is hierarchical data structure. Data structure is nothing but the process of arranging the…

Q: Binary tree in Java Create a method named findTotalleaves () to find all the nodes that are regarded…

A: Sure! Below is an implementation of a binary tree in Java with a method named findTotalLeaves() that…

Q: Write a deletion code of Red Black Tree in C++. Use this follwing Structure of Node: struct Node {…

A: Answer :- #include <iostream> using namespace std; struct Node { int data; Node…

Q: Draw the Recursion Execution Sequence. void preorder (tree_ptr ptr) { if (ptr) { (visit…

A: Preorder traversal involves scanning of the tree from the root, left, right. First, it scans the…

Q: What are some good applications of pre-order traversal in binary search trees?

A: Pre-order traversal is a popular way to traverse a binary search tree. It is a depth-first search…

Q: 4. Complete the fuction definition given below that takes the root node of a tree as a parameter and…

A: The answer is given below.

Q: Breadth-first search must be done without recursi

A: Coded using C++.

Q: Create a function that takes an array that represent a Binary Tree and a value and return true if…

A: Hi, since you haven't specified programming language, i will complete the problem in Python, Java ,…

Q: Write a java/c++ code or an algorithm to solve the following problem. After that dry run and show…

A: Answer :- Let the tree is : 1 / \ 2 3 / \ 4 5…

Q: AXC 6. Define. a treeNode class for .tree nodes that each .conslsts of following 4 fields: parent…

A: The syntax is defined below as per the question

Q: Binary Search Tree: Create a binary search tree using the Insert function. Insert integers 10, 18,…

A: According to the information given:- We have to create binary search tree with the help of Insert…

Q: question 5 : A node in a binary tree has the capacity to hold references to how many other nodes?…

A: Dear learner, hope you are doing well, I will try my best to answer this question. Thank You!!

Q: Write a function path that returns the path from the root of the tree to the given value item if it…

A: given we need to write code for function

Q: You will create a class for Employeelnfo that contains: • Employee ID Number – int • Employee Name –…

A: You will create a class for EmployeeInfo that contains: Employee ID Number – intEmployee Name –…

Q: What type of tree is returned from an instantiation of a tree class in the Java Standard Library…

A: The answer is given below step.

Q: void F(node&*root){if(root!=0){F(root->left); F(root->right); root->data=0; delete root;}root=0;}

A: void F(node<int>&*root){if(root!=0){F(root->left); F(root->right); root->data=0;…

Q: Create a function that takes an array that represent a Binary Tree and a value and return true if…

A: Algorithm - Take input from user. Now use the below logic - if (tree === null) return false; if…

Q: def odd average (t: Tree) -> float: ||||| Return the average of the odd values in t, 0 if none are…

A: Given a Tree class, we need to implement odd_average() method which takes the root of the tree as an…

Q: void printBetween(int min, int max) This function prints every value in the tree that is between min…

A: Solution: Tree node structure: struct Node { T data_; Node* left_; Node* right_;…

Q: Write a deletion code of Red Black Tree which delete a node in C++. Use this follwing Structure of…

A: #include <iostream> #include <queue> using namespace std; enum COLOR { RED, BLACK };…

Q: Computer Science In haskell, Write a function isSkewed of type Tree a -> Bool that tests whether a…

A: Computer Science In haskell, Write a function isSkewed of type Tree a -> Bool that tests whether…

Q: What are the constraints on a binary tree that is contained in an array?

A: What are the constraints on a binary tree that is contained in an array?

Q: What form of tree is produced when you instantiate a Java Standard Library tree for ordered data?

A: In the Java Standard Library, there is a data structure specifically designed for ordered data. This…

Q: Implement the binary tree ADT using a linked structure as we developed in class, add the following…

A: Solution:

Q: Add a constructor that constructs the binary search tree from the given DLList.

A: Method 1: Following is a simple algorithm where we first find the middle node of list and make it…

Q: In the binary search tree, write a function that takes in a root, p, and checks whether the tree…

A: The Python code along with the snapshot of code and output is given below.

Q: void F(node&*root){if(root!=0){F(root->left); F(root->right); root->data=0; delete root;}root=0;}…

A: First using the if loop it will first set both the leaves root to 0 then it will also set the root…

Q: 4. Complete the fuction definition given below that takes the root node of a tree as a parameter and…

A: Complete the given function definition that takes the root node of a tree as a parameter and returns…

Q: rite a insertion code of Red Black Tree in C++. Use this follwing Structure of Node (you cannot…

A: Insertion code of Red Black Tree in C++.

Question

Write the definition of a (recursive) member function of the `BinarySearchTree` class named `countGreaterThan` that takes a parameter `n` of type `elemType` and returns the number of nodes whose `data` field is greater than parameter `n`.

```cpp
// BinaryTree.h
#include <iostream>
using namespace std;

// Definition of the Node
template <class elemType>
struct TreeNode {
elemType data;
TreeNode<elemType> *left;
TreeNode<elemType> *right;
};

// Definition of class Binary Tree
template <class elemType>
class BinaryTree {
protected:
TreeNode<elemType> *root;
public:
BinaryTree();
BinaryTree(const BinaryTree<elemType>& otherTree);
~BinaryTree();
bool isEmpty() const;
virtual bool search(const elemType& searchItem) const = 0;
virtual void insert(const elemType& insertItem) = 0;
virtual void deleteNode(const elemType& deleteItem) = 0;
private:
int height(TreeNode<elemType> *p) const;
int nodeCount(TreeNode<elemType> *p) const;
int leafCount(TreeNode<elemType> *p) const;
};

// BinarySearchTree.h
#include "BinaryTree.h"
using namespace std;

template <class elemType>
class BinarySearchTree: public BinaryTree<elemType> {
public:
bool search(const elemType& searchItem) const;
void insert(const elemType& insertItem);
void deleteNode(const elemType& deleteItem);
private:
void displayAscending(TreeNode<elemType> *p) const;
TreeNode<elemType> * getTreeMax(TreeNode<elemType> *p) const;
TreeNode<elemType> * getTreeMin(TreeNode<elemType> *p) const;
};
```

### Explanation

This code represents the class specifications for a `BinaryTree` class and a `BinarySearchTree` class in C++. These classes are for managing binary trees and binary search trees, respectively.

- **TreeNode Structure**: This template structure holds the data for each node and pointers to left and right child nodes.

- **BinaryTree Class**:
- Inherits the `TreeNode` structure.
- Protected member `root` points to the root of the tree.
- Public member functions include constructors, destructors, and methods to check if the tree is empty, search, insert, and delete nodes.
- Private member functions calculate the height, the number of nodes, and the number of leaf nodes.

- **BinarySearchTree Class**:

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Please with question in image in C++ language. Thanks
Please write the code in C. The screenshot attched provides the template to write in C.
ASAP In C++: Write a public function that receives a BST of root (T) and two keys (K1) and (K2) with K1 ≤ K2 and prints all keys in the tree satisfying the condition K1 ≤ key ≤ K2 .
Create a function that takes an array that represent a Binary Tree and a value and return true if the value is in the tree and, false otherwise. Examples valueInTree (arr1, 5) true valueInTree (arr1, 9) → false valueInTree (arr2, 51) → false
Create a function that quickly determines if two nodes u and v in a tree T with s as the root are ancestors or descendants.
The following code implementation for an inorder traversal has a "visit" function as a parameter. I do not know how it works and what ways it plays a role in the traversal of the linked list in a binary tree.
Code it in C++
AXC 7. Following. the above node definition, define and Implement a binary tree class. with necessary access methods for the 4-field treeNodes, for example, setXXX, getXXX, isEmpty, etc.
Q12
E5
Write a struct that defines a binary tree node
4