2. a) Suppose the tree in Figure below is an unordered tree, i.e., the order in which the children appear is not relevant. Now determine whether each of the following breadth-first traversals is valid or not. You need to justify your answer: GFBKECAINJDHMLO GFBKECAINJDHMLO GKFBIJNEACOMLHD GFBKECAINJOMLHD (F

Create a function that checks whether a binary tree is balanced. For the sake of this issue, a balanced tree is one in which the heights of the two subtrees of each node never deviate by more than one.

You are given both the Post-order traversal and an in-order traversal for aunique binary tree.Post-order traversal: F A C D B EIn-order traversal: A F E C B D • Draw the unique tree defined by those traversals.• Write down the corresponding pre-order traversal for that tree.

PLease do A,B, and C Given the following tree: A.Is the tree balanced? If not, where is the tree out of balance? B.Is it a BST? If not, where is the violation of the search tree order? C.Show the order the nodes will be visited in a preorder, inorder, and postorder traversal. Be sure to clearly indicate which traversal is which.