hello Having a little trouble answering these three problems can i get some help
ID: 3835167 • Letter: H
Question
hello Having a little trouble answering these three problems can i get some help. So if you answer the problems can you make sure it is readable.
Discrete Math
Refer to the following tree diagram for 45-47 45. In the rooted tree TOwith root a), Answer the following: a. Parent of c b. Children of g c. Siblings of h d. Ancestors of e: e. Descendants of b 46. In the rooted tree T(with root a), Answer the following: a. Vertices: b. Leaves: 47. In the rooted tree T(with root a), Answer the following: a. Binary tree b. Height: c. Level of c:Explanation / Answer
45.
(a) The parent of any node is the particular node from where it is generated. In this given tree the parent of node C is B.
(b) Child of a node indicates the nodes which are generated from a particular node. Here in this given tree child of G are H,I,J.
(c) Siblings of a node indicates the other nodes which has same parent and which are in the same level. Here siblings of H are I and J.
(d) Ancestors of a node means a node reachable by repeated proceeding from child to parent. Here ancestors of the node E are C,B and A.
(e) A descendant node of a node is any node in the path from that node to the leaf node (including the leaf node). The immediate descendant of a node is the “child” node. So the descendant of B are C, D and E.
46.
(a) Vertices of this tree T are A,B,C,D,E,F,G,H,I,J,K,L and M
(b) A leaf of an unrooted tree is a node of vertex degree 1. Note that for a rooted or planted tree, the root vertex is generally not considered a leaf node, whereas all other nodes of degree 1 are. So leaves of this particular tree T are D,E,K,L,M,F and I.
47.
(a) In computer science, a binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child. So in this case T is not a binary tree.
(b) The height of a tree is the number of edges on the longest downward path between the root and a leaf. So the height of T is 3.
(c) Level – The level of a node is defined by 1 + the number of connections between the node and the root. So level of C is 3.
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.