1. 2. 23 3. 4. 5. 6. 7. 8. Describe a way to implement the tree...

   

Transcribed Image Text:

1. 2. 23 3. 4. 5. 6. 7. 8. Describe a way to implement the tree structure, corresponding to the diagram below: Ada Betty Carl Don Emily Describe a way to implement an expression tree. Write a basic Java class definition for a general-tree node, giving data members. Name or describe the member data items required to define a node of a general tree, where any node has an unbounded number of children. In the data structure called general tree, up to how many siblings may one node have? Explain, or draw a diagram. Write a Java class definition for a node of a family tree. A person's name and references to two parents are sufficient to describe the person. What does this code tell us about a tree, where p is a reference to the root? int weight (Node p) { } if (p = NULL) return 0; else return 1+p.getLeft().weight () + p.getRight (). weight(); Describe how to implement a binary tree; an m-ary tree. 1. 2. 23 3. 4. 5. 6. 7. 8. Describe a way to implement the tree structure, corresponding to the diagram below: Ada Betty Carl Don Emily Describe a way to implement an expression tree. Write a basic Java class definition for a general-tree node, giving data members. Name or describe the member data items required to define a node of a general tree, where any node has an unbounded number of children. In the data structure called general tree, up to how many siblings may one node have? Explain, or draw a diagram. Write a Java class definition for a node of a family tree. A person's name and references to two parents are sufficient to describe the person. What does this code tell us about a tree, where p is a reference to the root? int weight (Node p) { } if (p = NULL) return 0; else return 1+p.getLeft().weight () + p.getRight (). weight(); Describe how to implement a binary tree; an m-ary tree.