Page 1 of 1

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

Posted: Sat May 14, 2022 4:51 pm
by answerhappygod
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 1
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 1 (33.43 KiB) Viewed 35 times
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