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 connect the vertices

Answer 3

EDGES

Question 4

Each node of the graph is represented as a

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

Adds a vertex to the graph.

Answer 8

ADD VERTEX

Question 9

Adds an edge between the two vertices of the graph.

Answer 9

ADD EDGE

Question 10

Displays a vertex of the graph.

Answer 10

DISPLAY VERTEX

Question 11

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 11

DEPTH FIRST TRAVERSAL

Question 12

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 12

BREADTH FIRST TRAVERSAL

Question 13

represents the nodes connected by edges

Answer 13

TREE

Question 14

can be defined recursively as a collection of nodes

Answer 14

TREE DATA STRUCTURE

Question 15

represents the descendants of a node.

Answer 15

SUBTREE

Question 16

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

Answer 16

VISITING

Question 17

means passing through nodes in a specific order.

Answer 17

TRAVERSING

Question 18

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 18

LEVELS

Question 19

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

Answer 19

KEYS

Question 20

exhibits a special behavior.

Answer 20

BINARY SEARCH TREE

Question 21

an element in a tree/create a tree.

Answer 21

INSERT

Question 22

Searches an element in a tree.

Answer 22

SEARCH

Question 23

Traverses a tree in a pre-order manner.

Answer 23

PREORDER TRAVERSAL

Question 24

Traverses a tree in an in-order manner.

Answer 24

INORDER TRAVERSAL

Question 25

Traverses a tree in a post-order manner.

Answer 25

POSTORDER TRAVERSAL

Question 26

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

Answer 26

TRAVERSAL

Question 27

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

Answer 27

IN ORDER TRAVERSAL

Question 28

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

Answer 28

PRE ORDER TRAVERSAL

Question 29

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 29

POST ORDER TREAVERSAL

Question 30

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

Answer 30

BINARY TREE

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
An empty tree is height 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

DEGENARATE TREE

Question 37

A tree whose elements have at most 2 children is called

Answer 37

BINARY TREE DATA STRUCTURE

Question 38

is a node-based binary tree data structure which has the following properties:
1. The left subtree of a node contains only nodes with keys lesser than the node’s key.
2. The right subtree of a node contains only nodes with keys greater than the node’s key.
3. The left and right subtree each must also be a binary search tree.
4. There must be no duplicate nodes.

Answer 38

BINARY SEARCH TREE

Question 39

The tree always has a root node and further child nodes, whether on the left or right. The algorithm performs all the operations by comparing values with the root and its further child nodes in the left or right sub-tree accordingly

Question 40

Always initiate analyzing tree at the root node and then move further to either the right or left subtree of the root node depending upon the element to be located is either less or greater than the root

Answer 40

SEARCH OPERATION

Question 41

This is a very straight forward operation.

Answer 41

INSERT OPERATION

Question 42

is the most advanced and complex among all other operations

Answer 42

DELETE OPERATION