## Part 3 ITE6201 Data Structures and Algorithm Analysis

Graph G is _____________ if for any pair u, v of nodes in G, there is a path from u to v or path from v to u.

Every node N in a binary tree T except the root has a unique parent called the ________ of N.

In binary trees, nodes with no successor are called _______________.

Another name for directed graph.

A connected graph T without any cycles is called a ____________.

A connected graph T without any cycles is called ________________.

Trees are ________ if they are similar and have the same contents at corresponding nodes.

#### Feedback

Linked representation of binary tree needs ______ parallel arrays.

In a graph, if e=[u,v], then u and v are called _______________

TREE[1]=NULL indicates tree is _________

What does the sequential representation of binary trees use?

This is a terminal node in a binary tree.

The depth of complete binary tree is given by ________________.

Which indicates pre-order traversal?

This is a binary tree whose every node has either zero or two children.

In a 2-tree, nodes with 0 children are called ___________.

In an extended binary tree, nodes with 2 children are called _________________.

In a graph, if E=(u,v), it means _____________.