Describe an algorithm, relying only on the BinaryTree operations, that counts the number of leaves in a binary tree that their parents are the right child ren of a node.
Describe s your algorithm. Pseudo - code is preferred. All details of your algorithm are required to be given