Complete the size function using recursion
NOTE THAT THERE SHOULD BE NO COMPILERERRORS!!
The function must obey these restrictions:
+ no fields
+ no static fields
+ no loops (you cannot use “while” “for” etc…)
+ only one helper function per definition.
package algs32;
import algs13.Queue;
import stdlib.*;
/************************************************************************
* A simple BST with int keys
*
* Recall that:
* Depth of root==0.
* Height of leaf==0.
* Size of empty tree==0.
* Height of empty tree=-1.
*
* TODO: complete the functions in this file.
*
* Restrictions:
* – DO NOT change the Node class.
* – DO NOT change the first line of any function: name,parameters, types.
* – you may add new functions, but don’t delete anything
* – functions
PayPal Gateway not configured
PayPal Gateway not configured