Topic 13 (FINALS)

Question 1

is a widely used data structure that simulates a hierarchical tree structure, with a root value and subtrees of children with a parent node, represented as a set of linked nodes.

Answer 1

Tree

Question 2

_______ in a tree can have any number of children, compared to a binary tree.

Answer 2

Nodes

Question 3

A non-linear hierarchical data structure where each node can have any number of children.

Answer 3

Tree (General Tree)

Question 4

A special type of tree where each node can have at most two children — usually called left and right.

Answer 4

Binary Tree

Question 5

What are the types of Tree

Answer 5

Ordered Tree
Oriented Tree
Free Tree

Question 6

is a tree where the order of the children of each node matters. Changing the order of children creates a different tree. Each node’s children are arranged in a specific sequence (left-to-right order).

Answer 6

Ordered Tree

Question 7

In an ________ tree, the order of each node in the tree is significant.

Answer 7

Ordered Tree

Question 8

is a tree where the direction of edges is clearly defined — usually from parent to child.

Answer 8

Oriented Tree

Question 9

Oriented Tree is essentially a directed version of a tree, represented as a _____________

Answer 9

Directed Acyclic Graph (DAG).

Question 10

it is a tree in which the order of the subtrees of every node in a tree is immaterial / insignificant.

Answer 10

Oriented Tree

Question 11

is an undirected tree, meaning the edges have no direction.

Answer 11

Free Tree

Question 12

Free Tree defined as a connected __________

Answer 12

Acyclic Undirected Graph.

Question 13

has no designated root node and the orientation from a node to any other node is insignificant.

Answer 13

Free Tree

Question 14

What are the properties of a tree

Answer 14

Number of Nodes and Edges
Root Node
Parent and Child Nodes
Leaf (External) Nodes
Internal Nodes
Degree of a Node
Degree of a Tree
Level (Depth) of a Node
Height of a Tree
Subtree
Path
Ancestor and Descendant Nodes

Question 15

A tree with NNN nodes always has N−1N - 1N−1 edges. Except the root, each node has exactly one parent, which creates exactly one edge per node.

Answer 15

Number of Nodes and Edges

Question 16

is the topmost node of the tree. It has no parent and there is exactly one root in a tree.

Answer 16

Root Node

Question 17

is any node that has one or more children.

Answer 17

Parent

Question 18

is a node that descends from a parent.

Answer 18

Child Nodes

Question 19

are nodes with no children.

Answer 19

Leaf (External) Nodes

Question 20

They are usually located at the bottom level of the tree.

Answer 20

Leaf (External) Nodes

Question 21

are nodes that are not leaf nodes. They always have at least one child.

Answer 21

Internal Nodes

Question 22

is the maximum degree among all its nodes.

Answer 22

Degree of a Tree

Question 23

In a binary tree, the ______ is always less than or

Answer 23

Degree

Question 24

is its distance from the root.

Answer 24

Level (Depth) of a Node

Question 25

The root is at level 0, and its children are at level 1.

Answer 25

Level (Depth) of a Node

Question 26

is the length of the longest path from the root to a leaf.

Answer 26

Height of a Tree

Question 27

A tree with only the root node has a height of ________ depending on convention.

Answer 27

0 or 1

Question 28

is formed from any node and all of its descendants.

Answer 28

Subtree

Question 29

Every node in a tree can be considered the root of a _________.

Answer 29

Subtree

Question 30

is a sequence of nodes and edges connecting two nodes.

Answer 30

Path

Question 31

is defined as the number of edges

Answer 31

Path Length

Question 32

is any node that lies on the path from a given node to the root.

Answer 32

Ancestor

Question 33

is any node that comes below a given node in the hierarchy.

Answer 33

Descendant