The height of a binary tree is the number of edges in the longest path from the root to a leaf in the tree. The maximum possible height of a full binary tree with 23 nodes is $\_\_\_\_$ . (answer in integer)
Consider the following code snippet in C language that computes the number of nodes in a non-empty singly linked list pointed to by the pointer variable head.
struct node{
int elt;
struct node *next;
};
int getListSize (struct node *head)
{
if( E1 ) return 1;
return E2;
}
Which one of the following options gives the correct replacements for the expressions E 1 and E 2 ?
Let $P$ be the set of all integers from 1 to 15 . Consider any order of insertion of the elements of $P$ into a binary search tree that creates a complete binary tree. Which one of the following elements can NEVER be the third element that is inserted?
Consider the following pseudocode for depth-first search (DFS) algorithm which takes a directed graph $G(V, E)$ as input, where $d[v]$ and $f[v]$ are the discovery time and finishing time, respectively, of the vertex $v \in V$.
|
DFS(G): unmark all v ∈ V t ← 0 for each v ∈ V if v is unmarked t ← Explore(G, v, t) end if end for |
Explore(G, v, t): mark v t ← t + 1 d[v] ← t for each (v, w) ∈ E if w is unmarked t ← Explore(G, w, t) end if end for t ← t + 1 f[v] ← t return t |
Suppose that the input directed graph $G(V, E)$ is a directed acyclic graph (DAG). For an edge $(u, v) \in E$, which of the following options will NEVER be correct?
GATE CSE Papers
All year-wise previous year question papers