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](https://dsd5zvtm8ll6.cloudfront.net/si.experts.images/questions/2024/09/66f4edac19263_65966f4edab78f7e.jpg)

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 Node
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
