Question:
The post-order traversal of a binary tree is F A E K C D H G B. What is its root?
The post-order traversal of a binary tree is F A E K C D H G B. What is its root?
Show Hint
In post-order traversal, the root of the binary tree is always the last node visited.
Updated On: May 3, 2025
- A
- F
- C
- B
Hide Solution
Verified By Collegedunia
The Correct Option is D
Solution and Explanation
In post-order traversal, the root is the last element visited. Here, the last element in the traversal is B, making it the root.
Thus, the root of the tree is \( B \).
Thus, the root of the tree is \( B \).
Was this answer helpful?
0
0
Top Questions on Trees
- 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) - 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 \underline{{1cm}}. {(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?
- Consider the following algorithm tt{someAlgo that takes an undirected graph \( G \) as input.} tt{someAlgo(G)} Let \( v \) be any vertex in \( G \). Run BFS on \( G \) starting at \( v \). Let \( u \) be a vertex in \( G \) at maximum distance from \( v \) as given by the BFS. 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. 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) \begin{center} \includegraphics{q59_fig.png} \end{center}
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?
View More Questions
Questions Asked in AP PGECET exam
- The absolute humidity of air at 101.325 kPa is measured to be 0.02 kg of water per kg of dry air. Then the partial pressure of water vapour in the air is:
- AP PGECET - 2025
- Thermodynamics
- If the vapour pressure at two temperatures of a solid phase in equilibrium with its liquid phase is known, then the latent heat of fusion can be calculated by the:
- AP PGECET - 2025
- Thermodynamics
- 1 mole of Argon gas is heated at constant pressure from 200 K to 600 K.
If \( C_p = 4\ \text{cal} \cdot \text{deg}^{-1} \cdot \text{mol}^{-1} \), then the change in entropy will be:
(Given \( \ln 3 = 1.09 \))
- AP PGECET - 2025
- Thermodynamics
- The minimum amount of work required to operate a refrigerator which removes 1000 Cal heat at $0^\circ$C and rejects at $50^\circ$C will be:
- AP PGECET - 2025
- Thermodynamics
- The entropy of single crystalline Silicon at absolute zero will be:
- AP PGECET - 2025
- Thermodynamics
View More Questions