IB Computer Science HL

Consider the following binary tree.

An inorder traversal of this binary tree will produce a list of names sorted in ascending order.

$($c$.$i$)$ State the result of postorder traversal. $[1]$

Type your response here

$($c$.$ii$)$ Draw the binary tree after deleting the root node. $[3]$

Type your response here

$($d$)$ Compare the use of static and dynamic data structures. $[3]$

Type your response here