Programming Language : C++

Assume that you only gave a binary search tree. (this is not stored in array element or vector keys anymore)

1)Create a pseudocode of algorithm to print out all binary tree element by largest => smallest.

2) Also, calculate the asymptotic notation memory requirement to print the binary tree