Homework Answers
int numEvenNodes(node* root)
{
if(root==NULL)
return 0;
else if (root->data%2==0)
return 1+ numEvenNodes(root->left)+
numEvenNodes(root->right);
else
return numEvenNodes(root->left)+
numEvenNodes(root->right);
}
Add Answer to:
1) (10 pts) Write a recursive function that counts and returns the number of nodes in...
3) (10 pts) Write a function that takes in a root node of a trie and...
3) (10 pts) Write a function that takes in a root node of a trie and returns the length of the longest word stored in that trie. Use the struct given and function prototype given below. typedef struct trienode { int isWord; struct trienode* next [26]; } trienode; int maxWordLength (trienode* root) { // Fill in code }
Write a recursive function that compares two given binary trees. It returns 1 if the two...
Write a recursive function that compares two given binary trees. It returns 1 if the two trees are different, and it returns 0 otherwise. The function signature is: int treeDiff (node "a, node *b); Write a recursive function that counts how many nodes in a tree have a single child. The function signature is: int countoneChild(node "root);
2) (10 pts) Write a function that takes in a pointer to a linked list of...
2) (10 pts) Write a function that takes in a pointer to a linked list of nodes storing integers and a variable named value, and returns the number of nodes in the list storing that value. For example, if a list pointed to by listPtr stores 2, 6, 2, 3, 4, 2, 6, and 6 and value = 6, your function should return 3, since 6 appears in the list 3 times. Please use the struct and function prototype provided...
1. Write a recursive function that returns the sum of all even integers in a LinkedBinaryTree. Yo...
please explain each line of code! ( in python
)
1. Write a recursive function that returns the sum of all even integers in a LinkedBinaryTree. Your function should take one parameter, root node. You may assume that the tree only contains integers. You may not call any methods from the LinkedBinaryTree class. Specifically, you should traverse the tree in your function def binary tree even sum (root): Returns the sum of al1 even integers in the binary tree 2....
/* * struct for a single node in a binary tree. data contains the int *...
/* * struct for a single node in a binary tree. data contains
the int
* stored in this node. left and right contain pointers to the
left and
* right subtrees respectively. *
* All of the ints stored in the left subtree is smaller than
data.
* All of the ints stored in the right subtree is larger than
data.
*/
struct node {
int data;
struct node *left;
struct node *right;
};
typedef struct node node;
Write...
Write a recursive function (C++) that searches a binary tree that is NOT ordered like a...
Write a recursive function (C++) that searches a binary tree that is NOT ordered like a BST. In other words, there is no ordering relationship among the parent, child or sibling node values. Use the following prototype and data structure: struct node { node *left; node *right; int val; }; // First parameter: pointer to a node // Second parameter: the value to find bool searchValue(node *, int); The function searchValue() should return true if the integer value in the...
Answer the following question(s) concerning implementing recursive functions to perform operations on linked lists of nodes...
Answer the following question(s) concerning implementing recursive functions to perform operations on linked lists of nodes arranged as binary trees. For these questions, use the following struct definition for the nodes of the tree (we will not templatize the node here, so you do not have to write template functions for these questions, just assume trees of <int> values): struct BinaryTreeNode { int item; BinaryTreeNode* left; BinaryTreeNode* right; }; ---------------------------------------------- Given a node for a Binary Tree and an (integer)...
In Java: Given the following binary tree class, write a recursive method called size() which will...
In Java: Given the following binary tree class, write a recursive method called size() which will find the number of nodes in the subtree rooted at the current node: class myBinaryTree{ int myValue; myBinaryTree left; myBinaryTree right; myBinaryTree(int inValue) {myValue = inValue;} public int size(){ <CODE WRITTEN HERE> } }
Coding Language: C++ Function Header: vector<vector<int>> printFromButtom(TreeNode* root) {} Definition for a binary tree node: struct...
Coding Language: C++
Function Header: vector<vector<int>>
printFromButtom(TreeNode* root) {}
Definition for a binary tree node:
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
};
The Problem Complete the printFromButtom function that accepts a BST TreeNode and returns the nodes' value from left to right, level by level from leaf to root. This function will return vector<vector int which similar to a 2-D array. Function std: reverse (myvector.begin myVector en might be helpful. Definition for a binary tree node: struct...
PROMPT: Consider a binary tree (not necessarily a binary search tree) with node structure. QUESTION: Prove that findMax works by mathematical induction. struct Node int val; struct Node * left; struc...
PROMPT:
Consider a binary tree (not necessarily a binary search tree)
with node structure.
QUESTION:
Prove that findMax works by mathematical induction.
struct Node int val; struct Node * left; struct Node* right; The following function findMax returns the largest value 'val in the tree; and returns -1 if the tree is empty. You may assume that all the values 'val' in the tree are nonnegative. struct Node * findMax(struct Node root) if (rootNULL) return -1; maxval = root->val; maxval...
3) (10 pts) Write a function that takes in a root node of a trie and returns the length of the longest word stored in that trie. Use the struct given and function prototype given below. typedef struct trienode { int isWord; struct trienode* next [26]; } trienode; int maxWordLength (trienode* root) { // Fill in code }
Write a recursive function that compares two given binary trees. It returns 1 if the two trees are different, and it returns 0 otherwise. The function signature is: int treeDiff (node "a, node *b); Write a recursive function that counts how many nodes in a tree have a single child. The function signature is: int countoneChild(node "root);
2) (10 pts) Write a function that takes in a pointer to a linked list of nodes storing integers and a variable named value, and returns the number of nodes in the list storing that value. For example, if a list pointed to by listPtr stores 2, 6, 2, 3, 4, 2, 6, and 6 and value = 6, your function should return 3, since 6 appears in the list 3 times. Please use the struct and function prototype provided...
please explain each line of code! ( in python
)
1. Write a recursive function that returns the sum of all even integers in a LinkedBinaryTree. Your function should take one parameter, root node. You may assume that the tree only contains integers. You may not call any methods from the LinkedBinaryTree class. Specifically, you should traverse the tree in your function def binary tree even sum (root): Returns the sum of al1 even integers in the binary tree 2....
/* * struct for a single node in a binary tree. data contains
the int
* stored in this node. left and right contain pointers to the
left and
* right subtrees respectively. *
* All of the ints stored in the left subtree is smaller than
data.
* All of the ints stored in the right subtree is larger than
data.
*/
struct node {
int data;
struct node *left;
struct node *right;
};
typedef struct node node;
Write...
Coding Language: C++
Function Header: vector<vector<int>>
printFromButtom(TreeNode* root) {}
Definition for a binary tree node:
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
};
The Problem Complete the printFromButtom function that accepts a BST TreeNode and returns the nodes' value from left to right, level by level from leaf to root. This function will return vector<vector int which similar to a 2-D array. Function std: reverse (myvector.begin myVector en might be helpful. Definition for a binary tree node: struct...
PROMPT:
Consider a binary tree (not necessarily a binary search tree)
with node structure.
QUESTION:
Prove that findMax works by mathematical induction.
struct Node int val; struct Node * left; struct Node* right; The following function findMax returns the largest value 'val in the tree; and returns -1 if the tree is empty. You may assume that all the values 'val' in the tree are nonnegative. struct Node * findMax(struct Node root) if (rootNULL) return -1; maxval = root->val; maxval...
Most questions answered within 3 hours.
-
An infinite sheet of charge that has a surface charge density of
39 nC/m2 lies in...
asked 53 minutes ago -
After watching the lectures I am still having a hard time
understanding these equations.
1. The...
asked 2 hours ago -
Testing:
H0:μ=56.9
H1:μ<56.9
Your sample consists of 23 subjects, with a mean of 56.3 and
standard...
asked 2 hours ago -
straight wire, labeled as Wire A, lies horizontally on a
tabletop and is oriented to run...
asked 2 hours ago -
For a Chi-Squared Goodness of Fit Test about a uniform
distribution, complete the table.
Round to...
asked 2 hours ago -
Milk of magnesia is only slightly soluble in water. Kc for the
reaction Mg(OHs)(s)>Mg2+(a) + 2OH-1(aq)...
asked 2 hours ago -
Excel's HYPGEOM.DIST function can be used to compute _____.
a. both hypergeometric probabilities and cumulative
hypergeometric...
asked 2 hours ago -
The rocket used for the human lunar missions was the Saturn V
rocket. At liftoff the...
asked 2 hours ago -
1. The East Street Bagel Shop has a weekly demand for 3,500
bagels, which they make...
asked 2 hours ago -
paraphrasing each paragraph
“Where two or more persons knowingly act together unlawfully,
the act of each...
asked 2 hours ago -
The lateral line system in fish is contained which of the
following?
chemoreceptors
photoreceptors
mechanoreceptors
odor...
asked 2 hours ago -
Find the y-intercept of y =-5 x. The y-intercept of y equals
negative 5 x is______...
asked 2 hours ago