Graph Theory : Question answers for GATE

In a binary tree the post order traversal is DEBFCA. What will be the pre order traversal.

When a binary tree converted into the extended binary tree form, all the original nodes in binary tree called ____________.

Which statement is correctly explain about Tree

If a tree T having 21 vertices, then which statement will be true.

The in-order traversal of a tree will yield a sorted listing of elements of tree in _________.

Consider a binary tree, via special pointer certain null entries in binary tree are replaced which point to the nodes higher in the tree for efficiency. These special pointer are known as ___________.

Which statement is correct about a head tree?

The in-order traversal of tree will yield a sorted listing of elements of tree in______.

In a graph G what is the meaning of e= (u, v)________.

In a binary tree if every node has either zero (0) or two (2) children is known as________.

In a graph ‘G’ if every node ‘u’ is adjacent to every other node ‘v’ then the graph G is said to be________.

In a graph ‘G’ consider e=[u,v] then u and v are known as

In a tree the in-order traversing is represented as EACKFHDBG, What will be the pre-order traversal of the tree.

If a connected graph G having no cycles is called_____________.

In the linked list representation of Binary trees the LEFT[k] contains the_________of at the node N, where k represent the location of the node N.

Which set of standards ways of traversing in a binary tree T with root ‘R’ is correct?

A complete graph is defined as

By considering a threaded binary tree______________  points to higher nodes in tree.

If all the edges of a graph are assigned data then the graph is called _____________.

In a binary tree if node N is a terminal node then tree is called_______.