Topic: Discrete Mathematics and its Applications\" Chapter 11: Tree: Tree Traver

Question

Topic: Discrete Mathematics and its Applications" Chapter 11: Tree: Tree Traversal"

1. [Variation on 11.3#4. ] Suppose that the address of the vertex u in the ordered rooted tree T is 2.5.3.4.4. (a) At what level is v? (b) What is the address of the parent of v? Answer only; no explanation needed Answer only; no explanation needed. (c) What is the least number of siblings v can have? Answer only; no explanation needed. (d) What is the smallest possible number of vertices in T if vhas this address? Answer only; no explanation needed.

Explanation / Answer

a) v ia at level 5.

b) address pf paretnt of v is 2.5.3.4

c) v can ahve atleast three siblings.

d) Because 2.5.3.4.4 is the address of vertex v in T, T has atleast 1+2+5+3+4+5 = 22 vertices.

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.