QUESTION 3 What is the post-order traversal sequence for the following binary tree (2 is the root)? 2 10 6 5 11 2, 4, 10
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
QUESTION 3 What is the post-order traversal sequence for the following binary tree (2 is the root)? 2 10 6 5 11 2, 4, 10
QUESTION 3 What is the post-order traversal sequence for the following binary tree (2 is the root)? 2 10 6 5 11 2, 4, 10, 6, 5, 11 6,5, 4, 11, 10, 2 6.4.5.2, 10, 11 6,5, 11, 4, 10,2 QUESTION 4 For the following min-heap, what is the result of this heap in array representation after the delete-min operation? 17 19 36 25 100 2, 19, 3, 17, 100, 36. 7.25 2,3,7, 17, 19, 25, 36, 100 2, 17,3, 25, 19, 36, 7, 100 2, 17, 3, 19, 25, 36, 7, 100
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!