In a binary search tree with the following elements: \( 10, -4, 15, 13, 20, 5, 16, 19 \), the number of edges from node 19 to the root is?
Show Hint
- 3
- 4
- 2
- 5
The Correct Option is B
Solution and Explanation
The given elements are \( 10, -4, 15, 13, 20, 5, 16, 19 \). We can build the BST as follows:
1. \( 10 \) is the root.
2. \( -4 \) goes to the left of \( 10 \).
3. \( 15 \) goes to the right of \( 10 \).
4. \( 13 \) goes to the left of \( 15 \).
5. \( 20 \) goes to the right of \( 15 \).
6. \( 5 \) goes to the right of \( -4 \).
7. \( 16 \) goes to the left of \( 20 \).
8. \( 19 \) goes to the right of \( 16 \).
Step 2: Traversing from node 19 to the root.
- The path from node 19 to the root is: \( 19 \to 16 \to 20 \to 15 \to 10 \).
- Therefore, the number of edges is 4.
Thus, the correct answer is \( 4 \).
Top Questions on Trees
What is the output of the following C code?
void foo(int *p, int x) { *p = x; } void main() { int *z; int a = 20, b = 25; z = a; // Incorrect: Should be z = a; foo(z, b); printf("%d", a); }Issue: The statement
z = a;is invalid becauseais an integer, andzis a pointer.Which of the following is the greatest? \[ 0.6, \ 0.666, \ \frac{5}{6}, \ \frac{2}{3} \]
Consider the following code:
int a; int arr[] = {30, 50, 10}; int *ptr = arr[10] + 1; a = *ptr; (*ptr)++; ptr = ptr + 1; printf("%d", a + arr[1] + *ptr);Find the signed binary expansion of the number -6.
Given the following information:
The logical address (L.A.) is 32 bits. The physical address (P.A.) is 20 bits. The page size (P.S.) is 2048 bytes (2 KB). What is the maximum number of entries in the page table?
Questions Asked in GATE CS exam
- Given the sequence: \( 5, 6, 15, \_, 89, 170, 291 \), find the missing number.
- GATE CS - 2025
- Logical and Analytical Reasoning Skills
Consider the following C code:
int main() { sum = 0; for (n = 1; n < 3; n++) { n++; sum += g(f(n)); } printf("%d", sum); } int g(n) { return 10 + n; } int f(n) { return g(2 * n); }What is the output?
Match the following layers with their corresponding functionalities:
\[ \begin{array}{|c|c|} \hline \textbf{Layer} & \textbf{Functionality} \\ \hline \text{Networking Layer} & \text{Data packet transfer} \\ \text{Transport Layer} & \text{Host-to-host communication} \\ \text{Data Link Layer} & \text{Error detection and correction} \\ \hline \end{array} \]- GATE CS - 2025
- Programming in C
Let \( A \) be a \( 3 \times 3 \) matrix defined as:
\[ A = \begin{bmatrix} 1 & 1 & 1 \\ 1 & 1 & 1 \\ 1 & 1 & -1 \end{bmatrix} \]Find the eigenvalues of \( A^{13} \).
- GATE CS - 2025
- Programming in C
What is the time complexity of the following algorithm?
int func(int n) {
for (int i = 1; i < = n; i++) {
for (int j = 1; j < = n; j++) {
printf("Hello");
}
}
}- GATE CS - 2025
- Programming in C