Chapter 6

Question 1

non-linear abstract data type with a hierarchy-based structure.

Answer 1

tree

Question 2

refers to the sequence of nodes along the edges of a tree.

Answer 2

Path

Question 3

The node at the top of the tree is called .

Answer 3

Root

Question 4

Any node except the root node has one edge upward to a node called .

Answer 4

Parent

Question 5

The node below a given node connected by its edge downward is called

Answer 5

Child

Question 6

The node which does not have any child node is called

Answer 6

Leaf

Question 7

represents the descendants of a node.

Answer 7

Subtree

Question 8

refers to checking the value of a node when control is on the node.

Answer 8

Visiting

Question 9

means passing through nodes in a specific order.

Answer 9

Traversing

Question 10

represents the generation of a node. If the root node is at level 0, then its next child node is at level 1, its grandchild is at level 2, and so on.

Answer 10

Levels

Question 11

Represents a value of a node based on which a search operation is to be carried out for a node.

Answer 11

Keys

Question 12

The node which is a predecessor of a node is called the __ of that node.

Answer 12

Parent Node

Question 13

Any predecessor nodes on the path of the root to that node are called Ancestors of that node.

Answer 13

Ancestor of a Node

Question 14

Any successor node on the path from the leaf node to that node.

Answer 14

Descendant

Question 15

The count of edges on the path from the root node to that node.

Answer 15

Level of a node

Question 16

node with at least one child is called

Answer 16

Internal node

Question 17

Parent or child nodes of that node are called

Answer 17

Neighbour of a Node

Question 18

Any node of the tree along with its descendant.

Answer 18

Subtree

Question 19

each node can have a maximum of two children linked to it.

Answer 19

Binary tree

Question 20

a tree data structure in which each node has at most three child nodes, usually distinguished as “left”, “mid” and “right”.

Answer 20

Ternary Tree

Question 21

collection of nodes where each node is a data structure that consists of records and a list of references to its children(duplicate references are not allowed).

Answer 21

N-ary Tree or Generic Tree

Question 22

Create a tree in the data structure.

Answer 22

Create

Question 23

Inserts data in a tree.

Answer 23

Insert

Question 24

−
Searches specific data in a tree to check whether it is present or not.

Answer 24

Search

Question 25

perform Traveling a tree in a pre-order manner in the data structure.

Answer 25

Preorder Traversal

Question 26

perform Traveling a tree in an in-order manner.

Answer 26

In order Traversal 

Question 27

perform Traveling a tree in a post-order manner.

Answer 27

Post-order Traversal 

Question 28

a spanning tree with a weight less than or equal to the weight of every other spanning tree. 

Answer 28

A minimum spanning tree (MST)

Question 29

This algorithm always starts with a single node and moves through several adjacent nodes, in order to explore all of the connected edges along the way.

Answer 29

Prim’s algorithm

Question 30

A group of edges that connects two sets of vertices in a graph is called 

Answer 30

cut in graph theory.