Algorithms

Question 1

In which data structure a Traversal usually happen?

Answer 1

A tree

Question 2

What’s a node in the Tree data structure?

Answer 2

A node is a structure which may contain a value or condition, or represent a separate data structure.

Question 3

What’s a Root in the Tree data structure?

Answer 3

The top node in a tree, the prime ancestor.

Question 4

What’s a child in the Tree data structure?

Answer 4

A node directly connected to another node moving away from the root, an immediate descendant.

Question 5

What’s a parent in the Tree data structure?

Answer 5

The inverse of a child, an immediate ancestor.

Question 6

What is a leaf in the Tree data structure?

Answer 6

A node with no children

Question 7

What is an Internal node in the Tree data structure?

Answer 7

A node with at least one child.

Question 8

What is an edge in the Tree data structure?

Answer 8

The connection between one node and another

Question 9

What is depth in the Tree data structure?

Answer 9

The distance between a node and the root

Question 10

What is a level in the Tree data structure?

Answer 10

The number of edges between a node and the root + 1

Question 11

What is the height of the Tree data structure?

Answer 11

The number of edges on the longest path between a node and a descendant leaf.

Question 12

What is a breadth in the Tree data structure?

Answer 12

Is the number of leaves.

Question 13

What is a subtree in the Tree data structure?

Answer 13

A tree T is a tree consisting of a node in T and all of its descendants in T.

Question 14

What is a binary tree?

Answer 14

Is a tree data structure in which each node has at most two children, which are referred to as the left and right child.

Question 15

What is a binary search tree? List 3 main properties of a binary search;

Answer 15

is a special type of binary tree which has the following properties.

The left subtree of a node contains only nodes with keys lesser than the node’s key.
The right subtree of a node contains only nodes with keys greater than the node’s key.
The left and right subtree each must also be a binary search tree.

Question 16

What is a tree traversal?

Answer 16

In computer science, tree traversal (also known as tree search) is a form of graph traversal and refers to the process of visiting (checking and/or updating) each node in a tree data structure, exactly once. Such traversals are classified by the order in which the nodes are visited.

Question 17

What are the two main Tree Traversal algorithms?

Answer 17

Depth-First Search(DFS) and Breadth-First Search(BFS)

Question 17

What are the two main Tree Traversal algorithms?

Answer 17

Depth-First Search(DFS) and Breadth-First Search(BFS)

Question 18

How does the Depth-First Search(DFS) algorithm work?

Answer 18

t starts with the root node and first visits all nodes of one branch as deep as possible of the chosen Node and before backtracking, it visits all other branches in a similar fashion.

Question 19

How does the Breadth-First search (BFS) algorithm work?

Answer 19

It also starts from the root node and visits all nodes of current depth before moving to the next depth in the tree.

Question 20

What are the three main Depth-First Search(DFS) algorithms variants?

Answer 20

Preorder Traversal (current-left-right)— Visit the current node before visiting any nodes inside left or right subtrees.
    Inorder Traversal (left-current-right)— Visit the current node after visiting all nodes inside left subtree but before visiting any node within the right subtree.
    Postorder Traversal (left-right-current) — Visit the current node after visiting all the nodes of left and right subtrees.