Answering these questions:
1. What is the Big-O performance category in the worst case ofyour insert, delete, getRightNode and printLevel functions usingcompare operations
2. There are different strategies to implementing thisstructure, particularly the getRightNode and printLevel methods.Based on how you did it, what is at least one other way you couldhave developed these methods different from how you coded it? Wouldthe Big-O performance change significantly if you did so? If it isthe same Big-O, is it better or worse within that category?
3. Do you think there are any uses for having the ability toshow a level of a tree? If so, what
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured