Write a recursive function, leavesCount, that takes a root node (as a pointer) of a binary tree to its function parameter As an output of this function, you need to return the total number of leaf nodes in the tree. Define this function in the class definition file binaryTreeType.h. int binaryTreeType:leavesCount (binary TreeNode+ p) const

need help/explanation of how to do this. see image below   i tried writing something down for lines 7-9 but I'm really stuck

Can someone please help me read this because I can barely understand the handwriting

This is the program i have been given. I have to change it to meet the following criteria but can only change the body of the show_flashcard function       # IMPORTANT# Q2 (a)(iii) Make changes only to# -- the docstring for the program as a whole.# -- the docstring of the show_flashcard() function# -- the body of the show_flashcard() function. def show_flashcard():    """ Show the user a random key and ask them        to define it. Show the definition        when the user presses return.        """    random_key = choice(list(word_list))    print('Define: ', random_key)    input('Press return to see the definition')    print(word_list[random_key])     # Set up the word_list word_list = {'black':'noir',            'red':'rouge',            'yellow':'jaune',            'orange':'orange',            'white':'blanc',            'green':'vert'} # The interactive loop exit = Falsewhile not exit:    user_input = input('Enter s to show a flashcard and q to quit: ')    if user_input == 'q':…

Set up a segment selector for your program.

Hi I am so confused is not working :(