The post-order traversal of a binary tree is F A E K C D H G B. What is its root?
Show Hint
- A
- F
- C
- B
The Correct Option is D
Solution and Explanation
Thus, the root of the tree is \( B \).
Top Questions on Trees
Consider the following algorithm someAlgo that takes an undirected graph \( G \) as input.
someAlgo(G) Let \( v \) be any vertex in \( G \).
1. Run BFS on \( G \) starting at \( v \). Let \( u \) be a vertex in \( G \) at maximum distance from \( v \) as given by the BFS.
2. Run BFS on \( G \) again with \( u \) as the starting vertex. Let \( z \) be the vertex at maximum distance from \( u \) as given by the BFS. 3. Output the distance between \( u \) and \( z \) in \( G \).
The output of tt{someAlgo(T)} for the tree shown in the given figure is ____________ . (Answer in integer)
In a B+- tree where each node can hold at most four key values, a root to leaf path consists of the following nodes:
\( A = (49, 77, 83, -) \)
\( B = (7, 19, 33, 44) \)
\( C = (20^*, 22^*, 25^*, 26^*) \)
The *-marked keys signify that these are data entries in a leaf. Assume that a pointer between keys \( k_1 \) and \( k_2 \) points to a subtree containing keys in \([ k_1, k_2 )\), and that when a leaf is created, the smallest key in it is copied up into its parent. A record with key value 23 is inserted into the B+- tree. The smallest key value in the parent of the leaf that contains 25* is __________ . (Answer in integer)A meld operation on two instances of a data structure combines them into one single instance of the same data structure. Consider the following data structures:
P: Unsorted doubly linked list with pointers to the head node and tail node of the list.
Q: Min-heap implemented using an array.
R: Binary Search Tree.
Which ONE of the following options gives the worst-case time complexities for meld operation on instances of size \( n \) of these data structures?Suppose the values 10, −4, 15, 30, 20, 5, 60, 19 are inserted in that order into an initially empty binary search tree. Let \( T \) be the resulting binary search tree. The number of edges in the path from the node containing 19 to the root node of \( T \) is __________. (Answer in integer)
- Consider a binary tree \( T \) in which every node has either zero or two children. Let \( n%gt;0 \) be the number of nodes in \( T \). Which ONE of the following is the number of nodes in \( T \) that have exactly two children?
Questions Asked in AP PGECET exam
The rank of matrix \(\begin{bmatrix} k & -1 & 0 \\[0.3em] 0 & k & -1 \\[0.3em] -1 & 0 & k \end{bmatrix}\) is 2, for \( k = \)
- AP PGECET - 2024
- Rank of a Matrix
If \(A = \begin{bmatrix} 4 & 2 \\[0.3em] -3 & 3 \end{bmatrix}\), then \(A^{-1} =\)
- AP PGECET - 2024
- Inverse of a Matrix
A two-port network is defined by the relation
\(\text{I}_1 = 5V_1 + 3V_2 \)
\(\text{I}_2 = 2V_1 - 7V_2 \)
The value of \( Z_{12} \) is:- AP PGECET - 2024
- Two Port Networks
An induction motor when started on load does not accelerate up to full speed but runs at \({\frac {1}{17}}\)th of the rated speed. The motor is said to be:
- AP PGECET - 2024
- Induction Motor
A 0 to 30 V voltmeter has an error of \(\pm 2\%\) of FSD. What is the range of readings if the voltage is 30V?
- AP PGECET - 2024
- Errors in Measurement