list an explain some Application domians tgat uses heap data structure in their realization

A Binary tree is traversed by the Inorder and Preorder algorithms according to the following sequences: Inorder traversal: D, H, B, E, A, I, F, CJ, G, K Preorder traversal: A, B, D, H, E.C.E.I.G.),K What is the Postorder traversal sequence of this tree? O a. H, D, E, B, C, F, J, K, C, G, A b. The Postorder sequence can't be deduced OCH, D, E, B, I, F.J, K, G, C, A