The set T represents various traversals over binary tree. The set S represents the order of visiting nodes during a traversal.
| List I | List II |
|---|---|
| I. Inorder | L. left subtree, node, right subtree |
| II. Preorder | M. node, left subtree, right subtree |
| III. Postorder | N. left subtree, right subtree, node |
Which one of the following is the correct match from T to S ?
Let n be an odd number greater than 100. Consider a binary minheap with n elements stored in an array P whose index starts from 1.…
Consider a hash table P[0, 1, ..., 10] that is initially empty. The hash table is maintained using open addressing with linear pro…
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 h…
Consider the following program in C: ```c #include <stdio.h> void func(int i, int j) { if(i < j) { int i = 0; while (i <…
Consider the following code snippet in C language that computes the number of nodes in a non-empty singly linked list pointed to b…
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…
Free account benefits
Public PYQs and reference pages stay free. Sign in when you want GATEverse to remember what you studied and guide what to practise next.