Can I please get help?! Write a recursive function, leavesCount, that takes a root node (as a pointer) of a binary tree to its function parameterAs an output of this function, you need to return the total number of leaf nodes in the tree. Define this function in theclass definition file binaryTreeType.h.int binaryTreeType:: leaves Count (binary TreeNode p) const(b) Write a recursive function, height, that takes a root node (as a pointer) of a binary tree to its function parameter.Once it computes the height of the binary tree, return the height as a return value. Define this function in the classdefinition file binaryTreeType.h.int binaryTreeType:: height (binaryTreeNode *p) const(c) Write a recursive function, swapSubtreesOfNode, that swaps all of the left and right subtrees of a binary tree. Addthis function definition to the class binaryTreeType binaryTree.h.void binaryTreeType::swapSubtreesOfNode (binaryTreeNode *p)(d) Write your program satisfying the following tasks. Please note that the functions (inorder, preorder, and postorder)are defined already in the class.(a) Creates two bSearch TreeType objects (type as in intr(b) You need to prompt the user to insert keys into the tree. Use -999 to stop inserting. The -999 must not beConsidered as inputs.(c) Print tree nodes in inorder (see screenshots)(d) Print tree nodes in preorder (see screenshots)(e) Print tree nodes in postorder (see screenshots)(f) Print the height of the tree(g) Print the number of leave nodes for the tree(h) Print tree nodes in inorder after swapping subtrees.(i) Submit all the operations' screenshots.134988étvMacBook AirF5F7F8F12OLV% Microacft Vnual Studio Debug Censoleaiready in the list-duplicaten are not allewed. 02The insert itemThe innert iten is alrady in the lint-duplicutan are not alicwad. EaTree lieight: 0EE 2主 L 1件 1E ET E宝よ C :p uT apau aal劉 2 長 Z E t ES 2T EE よ pA1B uT apu al我台动老曲具ftr SHapsiae Subtrees e時相的水世会信和图Iree nodes in inorder: 99 8 82 F 68 66 61 56 43 4 21 12 10 76Iree nodes In preorder: 68 77 a2 99 88 72 43 56 61 66 1033 12 21 67iree nodes in postorde! 99 82 72 77 66 61 56 21 12 3376 10 43 68trWsers\Soo\ữneoriveBowie State UniversityCoursesC0SC214\TeachingtaterialsPLs\Chi1-3x64\Debug(a) SampleN Microsoft Visual Studio Debug ConsoleEnter numbers ending with -999351822 10 4 -999Tree Height: 5Number of leave nodes: 3Tree nodes in inorder: 1 3 4 5 8 10 22Tree nodes in preorder: 3 1 5 4 8 22 10Tree nodes in postorder: 1 4 10 22 8 5 3*車非車車車車*After swapping subtrees 車車曲1Tree nodes in inorder: 22 10 8 5 4 3 1Tree nodes in preorder: 3 5 8 22 10 4 1Tree nodes in postorder: 10 22 8 45 1 3C:\Users\Soo\OneDrive Bowie State University\Courses\CosC214\Teachings 31452) exited with code e.To automatically close the console when debugging stops, enable Tools-:(b) SampleFigure 1: Exa

Question

Can I please get help?! Write a recursive function, leavesCount, that takes a root node (as a pointer) of a binary tree to its function parameterAs an output of this function, you need to return the total number of leaf nodes in the tree. Define this function in theclass definition file binaryTreeType.h.int binaryTreeType:: leaves Count (binary TreeNode p) const(b) Write a recursive function, height, that takes a root node (as a pointer) of a binary tree to its function parameter.Once it computes the height of the binary tree, return the height as a return value. Define this function in the classdefinition file binaryTreeType.h.int binaryTreeType:: height (binaryTreeNode *p) const(c) Write a recursive function, swapSubtreesOfNode, that swaps all of the left and right subtrees of a binary tree. Addthis function definition to the class binaryTreeType binaryTree.h.void binaryTreeType::swapSubtreesOfNode (binaryTreeNode *p)(d) Write your program satisfying the following tasks. Please note that the functions (inorder, preorder, and postorder)are defined already in the class.(a) Creates two bSearch TreeType objects (type as in intr(b) You need to prompt the user to insert keys into the tree. Use -999 to stop inserting. The -999 must not beConsidered as inputs.(c) Print tree nodes in inorder (see screenshots)(d) Print tree nodes in preorder (see screenshots)(e) Print tree nodes in postorder (see screenshots)(f) Print the height of the tree(g) Print the number of leave nodes for the tree(h) Print tree nodes in inorder after swapping subtrees.(i) Submit all the operations' screenshots.134988étvMacBook AirF5F7F8F12OLV% Microacft Vnual Studio Debug Censoleaiready in the list-duplicaten are not allewed. 02The insert itemThe innert iten is alrady in the lint-duplicutan are not alicwad. EaTree lieight: 0EE 2主 L 1件 1E ET E宝よ C :p uT apau aal劉 2 長 Z E t ES 2T EE よ pA1B uT apu al我台动老曲 具ftr SHapsiae Subtrees e時相的水世会信和图Iree nodes in inorder: 99 8 82 F 68 66 61 56 43 4 21 12 10 76Iree nodes In preorder: 68 77 a2 99 88 72 43 56 61 66 1033 12 21 67iree nodes in postorde! 99 82 72 77 66 61 56 21 12 3376 10 43 68trWsers\Soo\ữneoriveBowie State UniversityCoursesC0SC214\TeachingtaterialsPLs\Chi1-3x64\Debug(a) SampleN Microsoft Visual Studio Debug ConsoleEnter numbers ending with -999351822 10 4 -999Tree Height: 5Number of leave nodes: 3Tree nodes in inorder: 1 3 4 5 8 10 22Tree nodes in preorder: 3 1 5 4 8 22 10Tree nodes in postorder: 1 4 10 22 8 5 3*車非車車車車*After swapping subtrees 車車曲1Tree nodes in inorder: 22 10 8 5 4 3 1Tree nodes in preorder: 3 5 8 22 10 4 1Tree nodes in postorder: 10 22 8 45 1 3C:\Users\Soo\OneDrive Bowie State University\Courses\CosC214\Teachings 31452) exited with code e.To automatically close the console when debugging stops, enable Tools-:(b) SampleFigure 1: Exa

Accepted Answer

Since multiple questions are asked so first three parts will be answered. Please upload remaining…