Implement the function for the prototype below. Document your code. You do not have access to...
Implement the function for the prototype below. Document your code. You do not have access to authors helper functions, only the binary_tree_node class.
template size_t count(binary_tree_node * root_ptr, Item value)
// Precondition: root_ptr is the root pointer of a binary tree (which may be empty).
// Postcondition: The number of nodes that contain value in the tree is returned.
Homework Answers
size_t count(binary_tree_node * root_ptr, Item value)
{
// if the current subtree is empty
if( !root_ptr )
return 0;
// if the current node has the value 'value'
if( root_ptr->data == value )
// recursively find the number of nodes in left and right subtree
return 1 + count( root_ptr->left, value ) + count( root_ptr->right, value );
else
// recursively find the number of nodes in left and right subtree
return count( root_ptr->left, value ) + count( root_ptr->right, value );
}
Add Answer to:
Implement the function for the prototype below. Document
your code. You do not have access to...
Short Answers Section 10.4 Tree Traversals 9. Using the binary_tree_node from Section 10.3, Write a recursive...
Short Answers Section 10.4 Tree Traversals 9. Using the binary_tree_node from Section 10.3, Write a recursive function to meet the following specification. You do not need to check the precondition. template <class Item> void increase(binary_tree_node<Item>* root_ptr) // Precondition: root_ptr is the root pointer of a binary tree. // Postcondition: Every node of the tree has had its data increased by one. 10. Using the binary_tree_node from Section 10.3, write a recursive function to meet the following specification. You do not...
9. Please implement the following function (recursively) 1. template < class Item> 2. void flip(binary_ tree_node...
9. Please implement the following function (recursively) 1. template < class Item> 2. void flip(binary_ tree_node Item root ptr) 3. I/ Precondition: root_ptr is the root pointer of a non-empty binary tree .I/ Postcondition: The tree is now the mirror image of its original value. Example: 2 3 3 2 Answer: 1. template class Item> 2. void lip (binary_tree_node <Item root ptr) 3. binary_tree_node <Ittemp; assert (root ptr!-NULL) 4.
Use a B-Tree to implement the set.h class. #ifndef MAIN_SAVITCH_SET_H #define MAIN_SAVITCH_SET_H #include <cstdlib> // Provides...
Use a B-Tree to implement the set.h class. #ifndef MAIN_SAVITCH_SET_H #define MAIN_SAVITCH_SET_H #include <cstdlib> // Provides size_t namespace main_savitch_11 { template <class Item> class set { public: // TYPEDEFS typedef Item value_type; // CONSTRUCTORS and DESTRUCTOR set( ); set(const set& source); ~set( ) { clear( ); } // MODIFICATION MEMBER FUNCTIONS void operator =(const set& source); void clear( ); bool insert(const Item& entry); std::size_t erase(const Item& target); // CONSTANT MEMBER FUNCTIONS std::size_t count(const Item& target) const; bool empty( ) const...
Write a function, swapSubtrees, that swaps all of the left and right subtrees of a binary...
Write a function, swapSubtrees, that swaps all of the left and right subtrees of a binary tree. Add this function to the class binaryTreeType and create a program to test this function. #include <iostream> using namespace std; //Definition of the Node template <class elemType> struct nodeType { elemType info; nodeType<elemType> *lLink; nodeType<elemType> *rLink; }; //Definition of the class template <class elemType> class binaryTreeType { public: //Overload the assignment operator. const binaryTreeType<elemType>& operator=(const binaryTreeType<elemType>&) { if (this != &otherTree) //avoid self-copy...
Requirements Print a range Write a bag member function with two parameters. The two parameters are...
Requirements Print a range Write a bag member function with two parameters. The two parameters are Items x and y. The function should write to the console all Items in the bag that are between the first occurrence of x and the first occurrence of y. You may assume that items can be compared for equality using ==. Use the following header for the function: void print_value_range(const Item& x, const Item& y); print_value_range can be interpreted in a number of...
Binary Search Tree Part A: The code attached in this document is a sample code to demonstrate ins...
Binary Search Tree Part A: The code attached in this document is a sample code to demonstrate insert operation in binary search tree. Please fill in the missing part for the insert method to make the program work. The expected output should be as follows. 20 30 40 50 60 70 80 Part B: Find Lowest Common Ancestor (LCA) of a Binary Search Tree. According to WikiPedia definition , The lowest common ancestor is defined between two nodes v and...
Please use the linked approach implement the BST ADT, implement all the functions in the BSTree.cpp....
Please use the linked approach implement the BST ADT,
implement all the functions in the BSTree.cpp. Add the ouput of the
implementation.
use recursive functions to traverse the tree - read the
implementation notes on using helper functions.
Please use C++ programming
//////////////////////////////////////////////////////////////
#include "BSTree.h"
template <typename DataType, class KeyType>
BSTree<DataType, KeyType>::BSTreeNode::BSTreeNode ( const
DataType &nodeDataItem, BSTreeNode *leftPtr, BSTreeNode
*rightPtr )
{
}
template < typename DataType, class KeyType >
BSTree<DataType, KeyType>::BSTree ()
{
root = 0;
}
template...
I need help implemeting the remove_repetitions() Here is a brief outline of an algorithm: A node...
I need help implemeting the remove_repetitions() Here is a brief outline of an algorithm: A node pointer p steps through the bag For each Item, define a new pointer q equal to p While the q is not the last Item in the bag If the next Item has data equal to the data in p, remove the next Item Otherwise move q to the next Item in the bag. I also need help creating a test program _____________________________________________________________________________________________________________________________________________________ #ifndef...
in python 11.1 Binary Search Tree In this assignment, you will implement a Binary Search Tree...
in python
11.1 Binary Search Tree In this assignment, you will implement a Binary Search Tree You will also need to implement a Node class. This class will not be tested, but is needed to implement the BST. Your BST must implement the following methods. You are free to implement additional helper methods. It is recommended you create your own helper methods Constructor: Creates an Empty Tree String Method: Returns the string "Empty Tree" for an empty tree. Otherwise, returns...
The goal of this task is to reinforce the implementation of container class concepts using linked...
The goal of this task is to reinforce the implementation of container class concepts using linked lists. Specifically, the task is to create an implementation file using a linked list. You need to use the header files, set3.h and node1.h, and the test program, test_set3.cpp. Your documentation must include the efficiency of each function. Please make your program as efficient and reusable as possible. set3.h #ifndef _SET_H #define _SET_H #include <cstdlib> #include <iostream> class set { public: typedef int value_type;...
9. Please implement the following function (recursively) 1. template < class Item> 2. void flip(binary_ tree_node Item root ptr) 3. I/ Precondition: root_ptr is the root pointer of a non-empty binary tree .I/ Postcondition: The tree is now the mirror image of its original value. Example: 2 3 3 2 Answer: 1. template class Item> 2. void lip (binary_tree_node <Item root ptr) 3. binary_tree_node <Ittemp; assert (root ptr!-NULL) 4.
Please use the linked approach implement the BST ADT,
implement all the functions in the BSTree.cpp. Add the ouput of the
implementation.
use recursive functions to traverse the tree - read the
implementation notes on using helper functions.
Please use C++ programming
//////////////////////////////////////////////////////////////
#include "BSTree.h"
template <typename DataType, class KeyType>
BSTree<DataType, KeyType>::BSTreeNode::BSTreeNode ( const
DataType &nodeDataItem, BSTreeNode *leftPtr, BSTreeNode
*rightPtr )
{
}
template < typename DataType, class KeyType >
BSTree<DataType, KeyType>::BSTree ()
{
root = 0;
}
template...
in python
11.1 Binary Search Tree In this assignment, you will implement a Binary Search Tree You will also need to implement a Node class. This class will not be tested, but is needed to implement the BST. Your BST must implement the following methods. You are free to implement additional helper methods. It is recommended you create your own helper methods Constructor: Creates an Empty Tree String Method: Returns the string "Empty Tree" for an empty tree. Otherwise, returns...
Most questions answered within 3 hours.
-
Define white-collar crime. What is the difference between
offender and offense-based definitions of white-collar crime? What...
asked 26 minutes ago -
Consider a reaction which is 1st order with respect to A and 1st
order with respect...
asked 36 minutes ago -
c++
The length of the hypotenuse of a right-angled triangle is the
square root of the...
asked 44 minutes ago -
When a metal rod is heated, not only its resistance but also its
length and cross‐sectional...
asked 45 minutes ago -
write a c++ program that computes the L^1 - Norm of a given
vector (L^1 norm...
asked 52 minutes ago -
A manufacturer of banana chips would like to know whether its
bag filling machine works correctly...
asked 1 hour ago -
Complete the chapter case, "Turnover Analysis".
Chapter Case
Turnover Analysis
You recently completed your company’s new...
asked 1 hour ago -
What is the pH of solutions having the following H3O+
concentrations? Identify each as acidic, basic,...
asked 1 hour ago -
How does over-voltage of the diode usually occur?
asked 1 hour ago -
If you step on a dirty nail, your doctor will recommend you
update your Tetanus vaccination....
asked 1 hour ago -
Suppose that decreases in the price of milk lead to decrease s
in the retail prices...
asked 1 hour ago -
To get a sample of a certain size, scores are taken one-by-one
from the observed data...
asked 1 hour ago