Hurry up.please.

Answer the following question: 6 points For the Binary tree shown in fig the pre-order traversal sequence is: B G H Unanswer 6 po For the tree shown below, how many of the nodes have at least one sibling? 2 11 3 10 30 7 AO 6 Q Q 1 7 poi If we run breadth first search on the following graph starting at vertex M, write a possible order for visiting the nodes. Note: your answer should be something like MNOPQRS. N 20 P ENNOROR MNOPOR 6 points If the numbers 10, 1.34, 8, 5, 15, 12, 16 are inserted into an empty binary search tree as per the order given, then what will be the height of the binary search tree? DKL