Problem Statement Write method label that returns a new tree, isomorphic (same shape) as the tree...

Transcribed Image Text:

Problem Statement Write method label that returns a new tree, isomorphic (same shape) as the tree parameter, but in which each node's info field is equal to the number of node to leaf paths in the subtree rooted at the node. Given the tree diagrammed below on the left, the tree returned should be as diagrammed on the right. The values in the tree passed as a parameter don't matter. You'll write code to create a new tree in which the value in each node is the number of node to leaf paths in the subtree rooted at that node. Class public class PathLabel { public TreeNode label (TreeNode t) { return null; } 4 8 12 1 10 10 15 1 1 9 16 The TreeNode class will be accessible when your method is tested. public class TreeNode { int info; TreeNode left; TreeNode right; TreeNode (int x) { info = x; } TreeNode (int x, TreeNode 1Node, TreeNode rNode) { info = x; left = 1Node; right = rNode; } } m 2 1 1 Problem Statement Write method label that returns a new tree, isomorphic (same shape) as the tree parameter, but in which each node's info field is equal to the number of node to leaf paths in the subtree rooted at the node. Given the tree diagrammed below on the left, the tree returned should be as diagrammed on the right. The values in the tree passed as a parameter don't matter. You'll write code to create a new tree in which the value in each node is the number of node to leaf paths in the subtree rooted at that node. Class public class PathLabel { public TreeNode label (TreeNode t) { return null; } 4 8 12 1 10 10 15 1 1 9 16 The TreeNode class will be accessible when your method is tested. public class TreeNode { int info; TreeNode left; TreeNode right; TreeNode (int x) { info = x; } TreeNode (int x, TreeNode 1Node, TreeNode rNode) { info = x; left = 1Node; right = rNode; } } m 2 1 1

Answer rating: 100% (QA)

Heres is ... View the full answer