Can I please get all the parts done? A- D A 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 funetion 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 int)(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,(1) Submit all the operations' screenshots.MacBook AiF5F6F7F1065&*

As per the Bartleby guideline, I can only solve the first question. Please post the remaining…

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

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

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Write a program named ProblemA.cpp that implements the followingfunctions using recursion. Make a menu-based implementation so that you can call each function basedon the user input. • insert: insert a new node in the BSTNode* insert (Node* root, int key); • print: prints the values of all items in the tree, using inorder traversal techniquevoid inorder (Node* root); • search: search a node with a value in the BSTNode* insert (Node* root, int key); • findMinimum: returns the element with the minimum value in the BSTNode* findMinimum (Node* root); • findMaximum: returns the element with the maximum value in the BSTNode* findMaximum (Node* root); • delete: delete a node from the BSTNode* delete (Node* root, int key);
Write a function f1 that takes the root of a binary tree as a parameter and returns thesum of the nodes which are the left child of another node. The root of the tree is not achild of any node.Consider the following class definitions while writing your code.class Node {public:int key;Node* left;Node* right;};
write a function in python that recieves the reference to the root (t) of a binary search tree and returns a listcontaining the keys in the path from the root of (t) to the largest key in (t). The function must use recursion Starting code: def path_to_largest(t): return [t.key]
a) The preorder traversal of a Binary Search Tree (BST) is given below.40 20 10 15 25 30 60 50 80 100 Draw the BST and briefly explain the process you followed to build the tree. b) Write a function f1 that takes the root of a binary tree as a parameter and returns the sum of the nodes, which are the left child of another node. The root of the tree is not a child of any node. Consider the following class definitions while writing your code.class Node {public:int key;Node* left;Node* right;};
Write a function f1 that takes the root of a binary tree as a parameter and returns thesum of the nodes, which are the right child of another node. The root of the tree is not achild of any node.
A sml binarySearch function that recursively implements the binary search algorithm to search a sorted integer list for a specified integer and returns true if it is found, false otherwise. For example, binarySearch ([100,200,300,400,500], 200) returns true, whereas binarySearch([100,200,300,400,500], 299) returns false. Hint: Write a helper function mid that returns a tuple (index, value) representing the middle value in a list. For example, mid [10, 2, 40, 8, 22] returns (2,40) because the value 40 at index 2 is the middle value in the list. Similarly, mid [10, 20] would return (1, 20). Use mid in conjunction with slice to implement binarySearch.
Write a function f1 that takes the root of a binary tree as a parameter and returns the sum of the nodes which are the right child of another node. The root of the tree is not a child of any node. Consider the following class definitions while writing your code. Using c++ language. class Node {public:int key;Node* left;Node* right;};
Define a function compress : lists(T) → lists(T) that accepts a list argument (of some generic type T) and returns a list without any subsequent redundancies, e.g. compress(⟨a, a, b, b, b, c, c, a, b⟩) = ⟨a, b, c, a, b⟩ 1. Transform the definition into a computable function.2. Define f recursively.3. Unfold your definition for compress(⟨a, a, b, b, c, a⟩).4. (PROGRAMMING) Please map your definition into a Common LISP function. Place your code in file compress.lisp. The code should behave as follows: > (compress ’(a a a b c d d e))(A B C D E)> (compress ’())NIL> (compress ’(a b c c c a))(A B C A)> (compress ’(a a b b c c c c a b b))(A B C A B)
Given an array that represents Breadth First Search or BFS traversal of a Complete Binary Search Tree, implement a recursive void method to print the preOrder traversal of the same Complete Binary Search Tree. You do not need to construct the BST. A Complete Binary Search Tree is a BST in which every level, except possibly the last, is completely filled, and all nodes are as far left as possible. Following is an example of a Complete Binary Search Tree: A. BFS traversal array (level by level from left to right): bfs[] = {50, 35, 55, 30, 45} B. PreOrder traversal (middle, left, right) : 50 35 30 45 55 Your recursive method "void convertBFStoPreOrder" will get an array A as an input and will print B. Hints: In the given BFS traversal array, bfs[], if i is the index of a parent, 2i+1 will give you the index of the left child, and 2i+2 will give you the index of the right child. "Assume that input array is always correct and represent a correct BFS traversal of a Complete BST."…
In this programming exercise you will implement two functions. The first function will prompt the user for a file containing the number of vertices and entries of the adjacency matrix of a graph. It will return a two-dimensional list (a list of lists) containing the adjacency matrix. The second function will take as input the a two-dimensional list that represents the adjacency matrix of a graph, runs Prim's algorithm, and returns the list of edges in a minimal spanning tree and the total weight of the spanning tree. I have figured out the first part of the program. i need help with the second part. Thanks text file 80 1 2 3 100 100 100 1001 0 2 100 3 4 100 1002 2 0 4 4 100 5 1003 100 4 0 100 100 4 100100 3 4 100 0 3 3 3100 4 100 100 3 0 100 1100 100 5 4 3 100 0 2100 100 100 100 3 1 2 0
Below is given a header file and a source file of a Binary Search Tree. Inputs are 6 , 4, 2 , 5, 1, 3, 8, 7, 9 Simulate the recursion for in-order and post order traversal of BST. you have to draw the tree and queue for the given inputs which will be for in-order and post order traversal. You need to write the steps of simulation in paper. binarysearchtree.h#ifndef BINARYSEARCHTREE_H_INCLUDED#define BINARYSEARCHTREE_H_INCLUDED#include "quetype.h"templatestruct TreeNode{ItemType info;TreeNode* left;TreeNode* right;};enum OrderType {PRE_ORDER, IN_ORDER,POST_ORDER};templateclass TreeType{public:TreeType();~TreeType();void MakeEmpty();bool IsEmpty();bool IsFull();int LengthIs();void RetrieveItem(ItemType& item,bool& found);void InsertItem(ItemType item);void DeleteItem(ItemType item);void ResetTree(OrderType order);void GetNextItem(ItemType& item,OrderType order, bool& finished);void Print();private:TreeNode* root;QueType preQue;QueType inQue;QueType postQue;};#endif //…
Write a function that inserts the nodes of a binary tree into an ordered linked list. Also write a program to test your function (C++)