Question: Please answer both questions. Thank you #3 [4 points] Consider the partial implementation of a Binary Search Tree class. For simplicity, each Node stores only

 Please answer both questions. Thank you #3 [4 points] Consider the

partial implementation of a Binary Search Tree class. For simplicity, each Node

Please answer both questions. Thank you

#3 [4 points] Consider the partial implementation of a Binary Search Tree class. For simplicity, each Node stores only the key Add a public member function to class BST that returns the size of the tree (Le the number of the nodes).(Hint; think recursion template typename class Node ( T key: Nodes left,-right, parent template typename T> class B3T private Node T root; BST root (nullptr) default constructor aets root to nullpt Noderight; else if (key s cur >key else return nullpts: // Not found int size() t YOUR CODE GOES HER

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!