GATE 2024 · session-1
Consider the following tree traversals on a full binary tree: • (i) Preorder • (ii) Inorder • (iii) Postorder Which of the following traversal options is/are sufficient to uniquely reconstruct the full binary tree?
Related Programming, Data Structures and Algorithms PYQs
Consider performing depth-first search (DFS) on an undirected and unweighted graph G starting at vertex s. For any vertex u in G, …
Match the items in Column 1 with the items in Column 2 in the following table: Column 1 | Column 2 --- | --- (p) First In First Ou…
Consider uniform hashing in an open-address hash table with load factor \(\alpha<1\), where \(n\) elements are stored in \(m\) slo…
Consider sorting the following array of integers in ascending order using an in-place Quicksort algorithm that uses the last eleme…
The fundamental operations in a double-ended queue D are: • insertFirst(e) = Insert a new element e at the beginning of D. • inser…
Consider the following Python code: ` def count(child_dict, i): if i not in child_dict.keys(): return 1 ans = 1 for j in child_dic…
Free account benefits
Turn practice into measurable progress
Public PYQs and reference pages stay free. Sign in when you want GATEverse to remember what you studied and guide what to practise next.
Saved progressKeep answers, mock results and completion history across devices.
Adaptive practiceGet questions matched to your recent accuracy and difficulty level.
Bookmarks and notesBuild a personal revision list and record why a question was difficult.
Performance insightsSee weak subjects, accuracy trends, streaks and exam readiness.