Given item- 40, 45, 80, 90, 50, 70. Draw Heap and Binary search tree (BST).

Given item- 40, 45, 80, 90, 50, 70. Draw Heap and Binary search tree (BST).

From the SGFL Assistant Engineer (IT) 2023 – Written (BUET) exam, question 4 of 7.

More from this paper

Previous: What is NAT? Explain with topological diagram.
Next: Find the output from this code- #include <stdio.h> void PrintArray(int num[], int n){ int i; for(i=0;i<n;i++) { printf("%d", num[i]); }…
All questions in SGFL Assistant Engineer (IT) 2023 – Written (BUET)