Suppose the values 10, -4, 15, 30, 20, 5, 60, 19 are inserted in that order into an initially empty binary search tree. Let be the resulting binary search tree. The number of edges in the path from the node containing 19 to the root node of is ________. (Answer in integer)
GATE CS 2025 (Afternoon) — Question 35
Data StructuresBinary Search Trees (BSTs) & Binary HeapsNAT1 markMedium
A GATE question every morning
One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.
More on Binary Search Trees (BSTs) & Binary Heaps
- GATE CS 2026 (Afternoon) · Q49Consider a binary search tree (BST) with n leaf nodes ( n > 0 ). Given any node V , the key present in the node is denoted as Val (V) . All…
- GATE CS 2025 (Forenoon) · Q26Which of the following statement(s) is/are TRUE for any binary search tree (BST) having n distinct integers?
- GATE CS 2025 (Forenoon) · Q35The height of any rooted tree is defined as the maximum number of edges in the path from the root node to any leaf node. Suppose a Min-Heap…
- GATE CS 2025 (Afternoon) · Q38A meld operation on two instances of a data structure combines them into one single instance of the same data structure. Consider the follo…
- GATE CS 2024 (Forenoon) · Q41An array [82, 101, 90, 11, 111, 75, 33, 131, 44, 93] is heapified. Which one of the following options represents the first three elements i…
- GATE CS 2024 (Forenoon) · Q43Consider a binary min-heap containing 105 distinct elements. Let k be the index (in the underlying array) of the maximum element stored in…

