Design and Explain (no code!) a recursive algorithm to count the number of leaf nodes in any given BST. Assume you have the following available: • Node class is defined (Node contains: integer "key", pointers to left and right nodes. Constructor takes in a value for key, and initializes right/left pointers to nullptr) • A tree is pre-built with all connections made. A pointer named "root" is given, which points to the root node Your algorithm should only need a pointer to the root node in order to work • Your algorithm should aim to return the total number of leaf nodes in the tree . Be sure to explain the base and general case(s) for your algorithm

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

can you please please do this in c++

Problem 1:
Design and Explain (no code!) a recursive algorithm to count the number of leaf nodes in any given BST. Assume you have the following available:
• Node class is defined (Node contains: integer "key", pointers to left and right nodes. Constructor takes in a value for key, and initializes right/left pointers to nullptr)
• A tree is pre-built with all connections made. A pointer named "root" is given, which points to the root node
• Your algorithm should only need a pointer to the root node in order to work
Your algorithm should aim to return the total number of leaf nodes in the tree
• Be sure to explain the base and general case(s) for your algorithm
Problem 2:
Implement your algorithm in code as best you can! Problem 1 and 2 are graded separately, so if you skip #1 you won't get full credit here!
Transcribed Image Text:Problem 1: Design and Explain (no code!) a recursive algorithm to count the number of leaf nodes in any given BST. Assume you have the following available: • Node class is defined (Node contains: integer "key", pointers to left and right nodes. Constructor takes in a value for key, and initializes right/left pointers to nullptr) • A tree is pre-built with all connections made. A pointer named "root" is given, which points to the root node • Your algorithm should only need a pointer to the root node in order to work Your algorithm should aim to return the total number of leaf nodes in the tree • Be sure to explain the base and general case(s) for your algorithm Problem 2: Implement your algorithm in code as best you can! Problem 1 and 2 are graded separately, so if you skip #1 you won't get full credit here!
Expert Solution
steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY