implementation of the Tree function is given below def odd average (t: Tree) -> float:I|||||Return the average of the odd values in t, 0 if none are odd.Assume all nodes have integer values.[Tree (5), Tree (6)])>>> t2 = Tree (2,>>> t3 = Tree (3, [Tree (7)])>>> t = Tree (1, [t2, t3, Tree (4)])>>> odd_average (t)4.0>>> odd_average (Tree (2))0.01Hn class Tree:WWF-2A bare-bones Tree ADT that identifies the root with the entire tree.===Attributes ===value value of root nodechildren root nodes of childrenvalue: objectchildren: List["Tree"]def __init__(self, value: object, children: List["Tree"]=None) -> None:201Create Tree self with content value and 0 or more childrenself.value = value#copy children if not Noneself children =children[:] if children is not None else []

Given a Tree class, we need to implement odd_average() method which takes the root of the tree as an…

def odd average (t: Tree) -> float: ||||| Return the average of the odd values in t, 0 if none are odd. Assume all nodes have integer values. >>>t2 Tree (2, [Tree (5), Tree (6)]) >>> t3 = Tree (3, [Tree (7)]) Tree (1, >>> odd_average (t) 4.0 [t2, t3, Tree (4)]) >>> odd_average (Tree (2)) 0.0

def odd average (t: Tree) -> float: ||||| Return the average of the odd values in t, 0 if none are odd. Assume all nodes have integer values. >>>t2 Tree (2, [Tree (5), Tree (6)]) >>> t3 = Tree (3, [Tree (7)]) Tree (1, >>> odd_average (t) 4.0 [t2, t3, Tree (4)]) >>> odd_average (Tree (2)) 0.0

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

Related questions

Q: Based on the non-recursive algorithm, implement the binary tree first order traversal, middle order…

A: Inorder (middle order) The obvious approach to navigating a tree without recursion is to use a…

Q: Write the definition of the function nodeCount that returns the number of nodes in the binary tree…

A: #include <iostream> //Line 1#include "binarySearchTree.h" //Line 2using namespace std; //Line…

Q: pre-order traversal

A: Given :- In the above given question, the statement is mention in the above given question Need to…

Q: write a c++ code using binary search tree to store ten names of cities, search city names in tree,…

A: A tree is a node-based data structure that contains the following properties: Each tree has a root…

Q: The following binary search tree functions for a binary search tree of integers. (This will…

A: Start the programDefine the class NodeDefine the required functionInsert the values into the binary…

Q: Write a recursive C function to calculate the height of a binary tree.

A: A recursive C function to calculate the height of a binary tree is as under:

Q: 4. Complete the fuction definition given below that takes the root node of a tree as a parameter and…

A: The answer is given below.

Q: Binary Search Tree: Create a binary search tree using the Insert function. Insert integers 10, 18,…

A: According to the information given:- We have to create binary search tree with the help of Insert…

Q: e Each node in a left-child, right-sibling tree T has a real integer >0 score. Find a subset S of…

A: Computer Science Each node in a left-child, right-sibling tree T has a real integer >0 score.…

Q: You will create a class for Employeelnfo that contains: Employee ID Number – int Employee Name -…

A: Solution: btft.h #include<iostream> #include<string> using namespace std; class…

Q: In a valid tree, the child pointer will only point to nodes which have not been seen before. Said…

A: Answer is given below .

Q: Write the full C++ code for the expected output

A: The provided C++ program demonstrates how to perform and visualize different binary tree traversal…

Question

implementation of the Tree function is given below

def odd average (t: Tree) -> float:
I|||||
Return the average of the odd values in t, 0 if none are odd.
Assume all nodes have integer values.
[Tree (5), Tree (6)])
>>> t2 = Tree (2,
>>> t3 = Tree (3, [Tree (7)])
>>> t = Tree (1, [t2, t3, Tree (4)])
>>> odd_average (t)
4.0
>>> odd_average (Tree (2))
0.0
1Hn

class Tree:
WWF-2
A bare-bones Tree ADT that identifies the root with the entire tree.
===Attributes ===
value value of root node
children root nodes of children
value: object
children: List["Tree"]
def __init__(self, value: object, children: List["Tree"]=None) -> None:
201
Create Tree self with content value and 0 or more children
self.value = value
#copy children if not None
self children =
children[:] if children is not None else []

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1

Step 2

Step 3

Step 4

Step by step

Solved in 4 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Similar questions

can you please do this in c++ please please
Please answer in c++ Please implement BST sort and test it for correctness. The program will prompt for the name of an input file and the read and process the data contained in this file. The file contains a sequence of integer values. Read them and construct a binary search tree from the values in the order they are read. Thus; the first number read will be the root of the tree. For this exercise, you may use dynamic data, but it is better to store the numbers sequentially in an array. You do not need to balance the tree as you construct it. When you have read the last value into the BST, conduct an in‐order traversal to output the values in ascending order. Print them 10 to a line in a 5‐character wide field. Note: there may be duplicated value in the input file – in this case each copy of the number should be kept in the tree and output. E.g. if the input was 3 5 3, the output would be 3 3 5. As usual, do not use classes or STL. text file:…
Complete the TODOs in C++ 1. Implement sumNodes function which sums the data of all the nodes of the tree. (Silver Problem)2. Implement printLeafNode function which prints just the leaf nodes of thetree. (Gold Problem) (.hpp file in image) 1st code is driver.cpp #include <iostream> #include "tree.hpp" using namespace std; #define COUNT 10 int main() { Treet; t.createTree(); //cout<<t.root->data<<endl; t.print2DUtil(t.root, 0); // 1, 2, 4, 5, 3, 6, 7 cout<<"\nPreorder traversal of binary tree is \n"; t.preOrderTraverse(t.root); cout<<endl; /********************** Silver problem ***********************/ cout<<"\nSum of all the nodes in tree is: "<<t.sumNodes(t.root); cout<<endl; /********************** Gold problem ***********************/ cout<<"\nPrinting leaf nodes of the tree \n"; t.printLeafNode(t.root); cout<<"\nDeleting the tree \n"; t.deleteTree(t.root); t.root=NULL; cout<<endl; return0; } 2nd code:…
Implement the pre-order tree traversal algorithm in C++. This program should use the following binary tree (see image) and display the pre-order tree traversal of the nodes’ values. Feel free to write this iteratively or recursively. Also, explain how it works and how a new tree could be provided to the code. PS: make sure that the logic of the program is correct, meaning that it can work well with different binary trees. I would like to change the tree input to the pre-order traversal function. The program should work errorless and display the result correctly. No need to code it to read the user input, however, provide instructions on how a new tree can be defined in this program to check if the program works fine with different trees.
4. Complete the fuction definition given below that takes the root node of a tree as a parameter and returns the count of nodes. int count_nodes(Node *root){ // complete the function }
Rewrite the definition of the function searchNode of the class B-tree provided (bTree.h) by using a binary search. Write a C++ code to ask the user to enter a list of positive integers ending with -999, build a b- tree of order 5 using the positive integers, and display the tree contents. Also, ask the user to enter a number to search and display if the number is found in the tree. bTree.h
Please write the code in C. The screenshot attched provides the template to write in C.