B Write a function which will take a binary trce as input and return the total number of nodesin: the tree. Your code must count the nodes by traversing the tree.a.b. Wite a function which will take a binary tree as input and return the number of totalnumber ef leaves in the tree. Your code must count the leaves by traversing the tree.c. Write code fer building (insertion) a ternary tree. A node (Ternary tree class) in a ternarytree may have at most 3 ehildren. You may need to modify the TreeNode class discussedir. class and adl functions to insert nodes.d. We discussed a methodology to delete a node which has 2 children from BST andin ormally argued avout the correctness of this methodology,An alternative methodology is shown below. The node X has two children, and we wish todelete X. The tree is rearanged as shown in the right after deleting X. Show that thealternative technique also preserves BST property. Write code to implement the alternativetechnique. [20]

Ans:) NOTE: As no programming language is mentioned I am using python for the mentioned program.…

Answered: b. Write a function which will take a…

b. Write a function which will take a binary tree as input and return the number of total number ef leaves in the tree. Your code must count the leaves by traversing the tree.

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: Write a function f1 that takes the root of a binary tree as a parameter and returns the sum of the…

A: For writing the function with given description follow below points: Include header file iostream.…

Q: Write a function f1 that takes the root of a binary tree as a parameter and returns the sum of the…

A: “f1 ()” function: The “f1 ()” function for given conditions: f1 (root r) { //check root…

Q: Write a function f1 that takes the root of a binary tree as a parameter and returns the sum of the…

A: The logic behind a function that takes the root of a binary tree as a parameter and returns the sum…

Q: Write a function f1 that takes the root of a binary tree as a parameter and returns the sum of the…

A: “f1 ()” function: The “f1 ()” function for given conditions: f1 (root r) { //check root…

Q: C++, Write a recursion function that counts the positive elements multiple of 5 in a binary search…

A: //make f1 and f2 as class variable and initialize with 0 int traverse(struct node *root) { if…

Q: Complete the examples in the docstring and then write the body of the following function: def…

A: def same_first_last(L):""" (list) -> boolPrecondition: len(L) >= 2Return True if and only if…

Q: Write a function permus (y, r) which computes all the r-permutations of the list y.

A: Code: #include <stdio.h>#include <string.h>void swap(char *x, char *y){ char temp; temp…

Q: Write a recursive function, leavesCount, that takes a root node (as a pointer) of a binary tree to…

A: #include <bits/stdc++.h>using namespace std; struct node{ int data; struct node* left; struct…