Trees

Question 1

A non-linear data structure that consists of nodes
and is connected by edges with a hierarchical
organization

Answer 1

Trees

Question 2

The nodes in a tree are arranged in a ________________

Answer 2

parent-child
relationship

Question 3

The topmost node in a tree is called the ______

Answer 3

root node

Question 4

It contains some data and
may have references to its child nodes.

Answer 4

Node

Question 5

Each element in tree

Answer 5

Node

Question 6

the first node of the tree. And is the initial node of the tree in data structures.

Answer 6

Root

Question 7

T or F

In the tree data structure, there must be only one root node.

Answer 7

T

Question 8

Represents a connection between two nodes. It defines the relationship between a parent node and its child node. A line connecting the nodes.

Answer 8

Edge

Question 9

A node that has one or more child nodes. It is located above its child nodes in the hierarchy.

Answer 9

Parent

Question 10

A node that has a parent node. It is located below
its parent node in the hierarchy.

Answer 10

Child

Question 11

Nodes that share the same parent. They are at
the same level in the tree.

Answer 11

Siblings

Question 12

A node that does not have any child nodes.
It is
also known as a terminal node.

Answer 12

Leaf

Question 13

Nodes that have one or more child
nodes. They are neither leaf nodes nor the root node.

Answer 13

Internal Nodes

Question 14

the total number of children of a node.

Answer 14

DEGREE

Question 15

The
highest degree of the node among all the nodes in a tree.

Answer 15

Degree of Tree

Question 16

the distance of a node from the root.

Answer 16

LEVEL

Question 17

The number of edges from the leaf node to the
particular node in the longest path is known as the height
of that node.

Answer 17

Height

Question 18

the height of the root node

Answer 18

“Height of Tree”.

Question 19

many edges from the root node to the particular
node

Answer 19

Depth

Question 20

In the tree, the total
number of edges from the root node to the leaf node in
the longest path

Answer 20

“Depth of Tree”.

Question 21

the sequence of nodes and edges from one node to another node is called the path between those two
nodes. The length of a this is the total number of nodes in this.

Answer 21

PATH

Question 22

TYPES OF TREES:

Answer 22

• GENERAL TREE:
• BINARY TREE:
• BINARY SEARCH TREE:
• AVL TREE:
• B-TREE:

Question 23

Properties
It follows all properties of the tree data structure.

A node can have any number of nodes.

Answer 23

GENERAL TREE:

Question 24

Properties
Follows all properties of the tree data structure.

It can have at most two child nodes.

These two children are called the left child and the right child

Answer 24

BINARY TREE

Question 25

Properties Left node value<= root node <= right node value Follows all properties of the tree data structure has a unique property known as the binary search property.

Answer 25

BINARY SEARCH TREE

Question 26

Properties Follows all properties of the tree data structure. Self-balancing. Each node stores a value called a balanced factor, which is the difference in the height of the left sub-tree and right sub-tree. All the nodes in the ________ must have a balance factor of -1, 0, and 1.

Answer 26

AVL TREE: (Georgy Adelson-Velsky and Landis - inventor)

Question 27

Properties is a special kind of self-balancing search tree in which each node can contain more than one key and can have more than two children. is also known as a height-balanced m-way tree.

Answer 27

B-TREE

Question 28

• a process of visiting each node and prints their value.

Answer 28

TREE TRAVERSAL

Question 29

LRN

Answer 29

Post-Order Traversal

Question 30

LNR

Answer 30

In-Order Traversal

Question 31

NLR

Answer 31

Pre-Order Traversal

Question 32

Can construct a unique binary tree from pre-order and Post-Order

Answer 32

Cannot!

Question 33

Can construct a unique binary tree from In-Order and Pre-Order ?

Answer 33

Can

Question 34

Can construct a unique binary tree from In-Order and Post-Order?

Answer 34

Can