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. class Node { public: int key; Node* left; Node* right; };

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. class Node { public: int key; Node* left; Node* right; };

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 10PE

See similar textbooks

Similar questions

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 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;};
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.
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) 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 Haskell function descending that receives a list and returns whether its values are in descending order. For example, given [], [42, 9, 9, 7] and "ymca" the function returns True; given [11, 5, 3, 4], "utopia" and "yummy" it returns False. ghci> descending "utopia" False
Write a Haskell function hasItem which takes two inputs: an integer item and a tree that is of the following recursive data type; hasItem returns True if tree has the item, otherwise hasItem returns False. data Tree = Leaf Int | Bintree Tree Char Tree deriving (Show)
In C++, Write the implementation for the methods of the Node class including the constructor. The constructor should set value to the passed in parameter, and set the value of the next pointer to NULL. getNext() should return the value of the next pointer. setNext() should set the value of the next pointer to the parameter that is passed in. In the main() function below (where it says // Step 2 code here), write the code to make a list of 10 Node objects. To do this, make a root pointer which is a pointer to a Node object, and then use a loop to create new Nodes, hooking up the list using setNext() and getNext() for each node. Set the value of each new Node to be the even numbers 2 through 18 (in addition to the root node which has value 0). Make sure that your nodes are linked together! Write code to step through your linked list (where it says // Step 3 code here), printing the value of each node. Write code to clean up the list (where it says // Step 4 code here). Print a…
Write a C++ function bool isBalancedBST(Node * r) that returns true if the the binary tree with root r is both a balanced binary tree and meats the criteria of being a BST. You many include helper functions it your want. Node is a struct type with fields int value, Node * left and Node * right. BTW if r is null that counts as a balanced BST. Upload a complete program with a main that tests your function on at least four test cases that will return true and four cases that return false. All the test cases should be trees with at least five nodes.
This is in c++ Given the MileageTrackerNode class, complete main() to insert nodes into a linked list (using the InsertAfter() function). The first user-input value is the number of nodes in the linked list. Use the PrintNodeData() function to print the entire linked list. Don't print the dummy head node. Example input : 3 2.2 7/2/18 3.2 7/7/18 4.5 7/16/18 output: 2.2, 7/2/18 3.2, 7/7/18 4.5, 7/16/18 main.cpp: #include "MileageTrackerNode.h"#include <string>#include <iostream>using namespace std; int main (int argc, char* argv[]) {// References for MileageTrackerNode objectsMileageTrackerNode* headNode;MileageTrackerNode* currNode;MileageTrackerNode* lastNode; double miles;string date;int i; // Front of nodes listheadNode = new MileageTrackerNode();lastNode = headNode; // TODO: Read in the number of nodes // TODO: For the read in number of nodes, read// in data and insert into the linked list // TODO: Call the PrintNodeData() method// to print the entire linked list //…
This is in c++ Given the MileageTrackerNode class, complete main() to insert nodes into a linked list (using the InsertAfter() function). The first user-input value is the number of nodes in the linked list. Use the PrintNodeData() function to print the entire linked list. Don't print the dummy head node. Example input : 3 2.2 7/2/18 3.2 7/7/18 4.5 7/16/18 output: 2.2, 7/2/18 3.2, 7/7/18 4.5, 7/16/18 main.cpp: #include "MileageTrackerNode.h"#include <string>#include <iostream>using namespace std; int main (int argc, char* argv[]) {// References for MileageTrackerNode objectsMileageTrackerNode* headNode;MileageTrackerNode* currNode;MileageTrackerNode* lastNode; double miles;string date;int i; // Front of nodes listheadNode = new MileageTrackerNode();lastNode = headNode; // TODO: Read in the number of nodes // TODO: For the read in number of nodes, read// in data and insert into the linked list // TODO: Call the PrintNodeData() method// to print the entire linked list //…
Edsgar Dijkstra is known for his work on programming languages. Hecame up with a neat problem that he called the Dutch National Flagproblem: given a list of strings, each of which is either 'red', 'green', or 'blue'(each is repeated several times in the list), rearrange the list so that thestrings are in the order of the Dutch national flag—all the 'red' stringsfirst, then all the 'green' strings, then all the 'blue' strings.Write a function called dutch_flag that takes a list and solves this problem.