Write a recursive private method called countDegree to be included in class BinaryTree as discussed in the lectures. If a node is having two child nodes, then its degree is two, if it is having one child node, its degree is one and leaf nodes have degree 0. The method counts and returns the total degree of all the nodes in the binary tree.Example: If a binary tree is having 9 nodes such that 3 nodes, each have 2 child nodes, 2 nodes each have only one child and there are 4 leaf nodes. So, the total degree of the binary tree = 3x2 + 2x1 + 0 = 8.This method is called from a public method countDegreeBT, given as follows:public int countDegreeBT(){return countDegree(root);}Method heading:private int countDegree(Node<E> node) Write a recursive private method called countDegree to be included in class BinaryTree as discussed in the lectures. If a node ishaving two child nodes, then its degree is two, if it is having one child node, its degree is one and leaf nodes have degree 0. Themethod counts and returns the total degree of all the nodes in the binary tree.Example: If a binary tree is having 9 nodes such that 3 nodes, each have 2 child nodes, 2 nodes each have only one child and thereare 4 leaf nodes. So, the total degree of the binary tree = 3x2 + 2x1 -0 = 8.This method is called from a public method countDegreeBT, given as follows:public int countDegreeBTO{return countDegree(root);Method heading:private int countDegree (Node node)

Following are code to the given question: private int countDegree(Node<E> node)//defining a…

Answered: Write a recursive private method called…

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

Question

Write a recursive private method called countDegree to be included in class BinaryTree as discussed in the lectures. If a node is having two child nodes, then its degree is two, if it is having one child node, its degree is one and leaf nodes have degree 0. The method counts and returns the total degree of all the nodes in the binary tree.

Example: If a binary tree is having 9 nodes such that 3 nodes, each have 2 child nodes, 2 nodes each have only one child and there are 4 leaf nodes. So, the total degree of the binary tree = 3x2 + 2x1 + 0 = 8.

This method is called from a public method countDegreeBT, given as follows:

public int countDegreeBT()

{

return countDegree(root);

}

Method heading:

private int countDegree(Node<E> node)