Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
unt, that takes a root node (as a pointer) of a binary tree to its function parameter. nte a recursive funICLIOu, 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 (b) Write a recursive function, height, that takes a root odo (ng

unt, that takes a root node (as a pointer) of a binary tree to its function parameter. nte a recursive funICLIOu, 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 (b) Write a recursive function, height, that takes a root odo (ng

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
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 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<elem Type >:: leaves Count (binary TreeNode<elemType> 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 class definition file binaryTreeType.h. int binaryTreeType<elemType>:: height (binaryTreeNode<elemType> *p) const (c) Write a recursive function, swapSubtreesOfNode, that swaps all of the left and right subtrees of a binary tree. Add this function definition to the class binaryTreeType binaryTree.h. void binaryTreeType<elemType>::swapSubtreesOfNode (binaryTreeNode<elemType> *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 be Considered 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 étv MacBook Air F5 F7 F8 F12 OL V %
Transcribed Image Text: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<elem Type >:: leaves Count (binary TreeNode<elemType> 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 class definition file binaryTreeType.h. int binaryTreeType<elemType>:: height (binaryTreeNode<elemType> *p) const (c) Write a recursive function, swapSubtreesOfNode, that swaps all of the left and right subtrees of a binary tree. Add this function definition to the class binaryTreeType binaryTree.h. void binaryTreeType<elemType>::swapSubtreesOfNode (binaryTreeNode<elemType> *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 be Considered 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 étv MacBook Air F5 F7 F8 F12 OL V %
Microacft Vnual Studio Debug Censole aiready in the list-duplicaten are not allewed. 02 The insert item The innert iten is alrady in the lint-duplicutan are not alicwad. Ea Tree lieight: 0 EE 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 76 Iree nodes In preorder: 68 77 a2 99 88 72 43 56 61 66 1033 12 21 67 iree nodes in postorde! 99 82 72 77 66 61 56 21 12 3376 10 43 68 trWsers\Soo\ữneorive Bowie State UniversityCoursesC0SC214\TeachingtaterialsPLs\Chi1-3x64\Debug (a) Sample N Microsoft Visual Studio Debug Console Enter numbers ending with -999 351822 10 4 -999 Tree Height: 5 Number of leave nodes: 3 Tree nodes in inorder: 1 3 4 5 8 10 22 Tree nodes in preorder: 3 1 5 4 8 22 10 Tree nodes in postorder: 1 4 10 22 8 5 3 *車非車車車車*After swapping subtrees 車車曲1 Tree nodes in inorder: 22 10 8 5 4 3 1 Tree nodes in preorder: 3 5 8 22 10 4 1 Tree nodes in postorder: 10 22 8 45 1 3 C:\Users\Soo\OneDrive Bowie State University\Courses\CosC214\Teaching s 31452) exited with code e. To automatically close the console when debugging stops, enable Tools-: (b) Sample Figure 1: Exa
Transcribed Image Text:Microacft Vnual Studio Debug Censole aiready in the list-duplicaten are not allewed. 02 The insert item The innert iten is alrady in the lint-duplicutan are not alicwad. Ea Tree lieight: 0 EE 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 76 Iree nodes In preorder: 68 77 a2 99 88 72 43 56 61 66 1033 12 21 67 iree nodes in postorde! 99 82 72 77 66 61 56 21 12 3376 10 43 68 trWsers\Soo\ữneorive Bowie State UniversityCoursesC0SC214\TeachingtaterialsPLs\Chi1-3x64\Debug (a) Sample N Microsoft Visual Studio Debug Console Enter numbers ending with -999 351822 10 4 -999 Tree Height: 5 Number of leave nodes: 3 Tree nodes in inorder: 1 3 4 5 8 10 22 Tree nodes in preorder: 3 1 5 4 8 22 10 Tree nodes in postorder: 1 4 10 22 8 5 3 *車非車車車車*After swapping subtrees 車車曲1 Tree nodes in inorder: 22 10 8 5 4 3 1 Tree nodes in preorder: 3 5 8 22 10 4 1 Tree nodes in postorder: 10 22 8 45 1 3 C:\Users\Soo\OneDrive Bowie State University\Courses\CosC214\Teaching s 31452) exited with code e. To automatically close the console when debugging stops, enable Tools-: (b) Sample Figure 1: Exa
Expert Solution
steps

Step by step

Solved in 3 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS