itec33

Question 1

is a pictorial representation of a set of objects where some pairs of objects are connected by links.

Answer 1

graph

Question 2

The interconnected objects are represented by points

Answer 2

vertices

Question 3

links that connected the vertices

Answer 3

edges

Question 4

Each node of the graph is represented as ___

Answer 4

vertex

Question 5

represents a path between two vertices or a line between two vertices

Answer 5

edge

Question 6

Two node or vertices are adjacent if they are connected to each other through an edge.

Answer 6

adjacency

Question 7

represents a sequence of edges between the two vertices.

Answer 7

path

Question 8

basic primary operations of a graph

Answer 8

add vertex
add edge
display vertex

Question 9

algorithm traverses a graph in a depthward motion and uses a stack to remember to get the next vertex to start a search, when a dead end occurs in any iteration.

Answer 9

depth first traversal (dfs)

Question 10

algorithm traverses a graph in a breadthward motion and uses a queue to remember to get the next vertex to start a search, when a dead end occurs in any iteration.

Answer 10

breadth first traversal (bfs)

Question 11

represents the nodes connected by edges.

Answer 11

tree

Question 12

can be defined recursively as a collection of nodes (starting at a root node), where each node is a data structure consisting of
a value, together with a list of references to nodes (the “children”), with the constraints that
no reference is duplicated, and none points to the root.

Answer 12

tree data structure

Question 13

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

Answer 13

path

Question 14

The node at the top of the tree

Answer 14

root

Question 15

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

Answer 15

parent

Question 16

The node below a given node connected by its edge downward

Answer 16

child

Question 17

The node which does not have any child node

Answer 17

leaf

Question 18

represents the descendants of a node.

Answer 18

subtree

Question 19

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

Answer 19

visiting

Question 20

means passing through nodes in a specific order.

Answer 20

traversing

Question 21

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 21

levels

Question 22

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

Answer 22

keys

Question 23

A node’s left child must have a value less than its parent’s value and the node’s right child must have a value greater than its parent value.

Answer 23

binary search tree representation

Question 24

basic operations in binary search tree data structure

Answer 24

insert
search
preorder traversal
in-order traversal
post-order traversal

Question 25

process to visit all the nodes of a tree and may print their values too.

Answer 25

traversal

Question 26

In this traversal method, the left subtree is visited first, then the root and later the right sub-tree.

Answer 26

inorder traversal

Question 27

In this traversal method, the root node is visited first, then the left subtree and finally the right subtree.

Answer 27

pre-order traversal

Question 28

In this traversal method, the root node is visited last, hence the name. First we traverse the left subtree, then the right subtree and finally the root node.

Answer 28

post-order traversal

Question 29

is a hierarchical data structure in which each node has at most two children generally referred as left child and right child.

Answer 29

binary tree

Question 30

3 components of nodes

Answer 30

pointer to left subtree
pointer to right subtree
data element

Question 31

It has a root node and every node has at most two children.

Answer 31

rooted binary tree

Question 32

It is a tree in which every node in the tree has either 0 or 2 children.

Answer 32

full binary tree

Question 33

It is a binary tree in which all interior nodes have two children and all leaves have the same depth or same level.

Answer 33

perfect binary tree

Question 34

It is a binary tree in which every level, except possibly the last, is completely filled, and all nodes are as far left as possible.

Answer 34

complete binary tree

Question 35

A binary tree is height balanced if it satisfies the following constraints:

1. The left and right subtrees’ heights differ by at most one, AND
2. The left subtree is balanced, AND
3. The right subtree is balanced

Answer 35

balanced binary tree

Question 36

It is a tree is where each parent node has only one child node. It behaves like a linked list

Answer 36

degenerate tree

Question 37

types of binary tree

Answer 37

rooted
full
perfect
complete
balanced
degenerate

Question 38

binary search tree operations

Answer 38

search
insert
delete

Question 39

node with two children rules

Answer 39

in order predecessor
in order successor