1 Presented By RC ID No 1192 Name

1 Presented By RC ID No. 1192 Name: Ms. Salve Amrapali Kishanrao ME(CSE), Ph. D(Pursing) MGM’s College of Engineering, Nanded. 2/22/2021 Craeted By Ms. Salve A. K.

Outlines • Introduction • Terminologies - Root -Parent Node -Edge -Siblings -Ancestor Node -Descendant Node 2 Craeted By Ms. Salve A. K. 2/22/2021

1. Root: In a tree data structure, the first node is called as Root Node. Here Root is A 2. Edge: In a tree data structure, the connecting link between any two nodes is called as EDGE. Here edge is(A, B). 3. Parent: In a tree data structure, the node which is predecessor of any node is called as PARENT NODE. Here the parent Nodes are B, C, E, G ect. 4. Child: In a tree data structure, the node which is descendant of any node is called as CHILD Node. Here D, E, F are the Childs of B Parents 5. Siblings: In a tree data structure, nodes which belong to same Parent are called as SIBLINGS. Here E is the Siblings of D 6. Degree: In a tree data structure, the total number of children of a node is called as DEGREE of that Node. Degree of E is 2. 7. Degree: In a tree data structure, the total number of children of a node is called as DEGREE of that Node. Degree of E is 2 8. Ancestor: The predecessor of a node together with all the ancestors of the predecessor of a node. 9. Descendant: The children of a node together with all the descendants of the Craeted By Ms. Salve A. K. 2/22/2021 3 children of a node.

1)Define Siblings? (2. 35 minutes) Ans: In a tree data structure, nodes which belong to same Parent are called as SIBLINGS. 2) Define grandparents, child/ leaf node? (2. 45) Ans: In a tree data structure, the node which is descendant of any node is called as CHILD Node. 2) Determine the ancestors and descendant node of the tree? (3: 18 Minutes) Ans: D is the Ancestor of E , E is the descendant of D 3) Whats the degree of b node? (6. 35 Minutes ) Ans: Degree of B node is 2. 4 Craeted By Ms. Salve A. K. 2/22/2021