***Make sure to explain your answers*** ***Will give an upvote if can do all*** 1) 2) 3) 4)
Posted: Fri May 20, 2022 12:57 pm
***Make sure to explain your answers***
***Will give an upvote if can do all***
1)
2)
3)
4)
Traverse the following graph by Breadth First Search starting from vertex A. Always choose the vertex with the smallest letter first, if there are more than one option. B F E
Which of the following is a min heap? 10 10 (A) (B) 10 10 11 (c) (D)
What is the minimum number of nodes for a complete binary tree with height 4? 4 7 8 15
What is the number of nodes for a full binary tree with height 4? 4 7 8 15
***Will give an upvote if can do all***
1)
- Make Sure To Explain Your Answers Will Give An Upvote If Can Do All 1 2 3 4 1 (60.29 KiB) Viewed 33 times
- Make Sure To Explain Your Answers Will Give An Upvote If Can Do All 1 2 3 4 2 (67.56 KiB) Viewed 33 times
- Make Sure To Explain Your Answers Will Give An Upvote If Can Do All 1 2 3 4 3 (25.37 KiB) Viewed 33 times
- Make Sure To Explain Your Answers Will Give An Upvote If Can Do All 1 2 3 4 4 (19.29 KiB) Viewed 33 times
Which of the following is a min heap? 10 10 (A) (B) 10 10 11 (c) (D)
What is the minimum number of nodes for a complete binary tree with height 4? 4 7 8 15
What is the number of nodes for a full binary tree with height 4? 4 7 8 15