44Here is a small binary tree 14 2 11 13 10 30 Circle all the leaves. Put a square box around the root. Draw a star around each . Put a big X through every descendant of the node the contains ancestor of the node that contains 10. 4s There is a tree in the question 44. What is the depth of the tree? 46 There is a tree in the question 44. How many children does the root have 47 There is a tree in the question 44. What is the degree of the node that contains 7 48 Suppose T is a binary tree with 14 nodes What is the minimum possible depth of C4 D.5 9Binary Tree can be represented in memory by b) Hash table c)None of the above a) Linked Litt 50 In a sequential binary tree the children of a node stored in location K will be stored in location a) 2*k 51 A complete binary tree is binary tree if a) completely filled c) Both A and b) all nodes appear as far left ne of the above 52 Every node in tree has parent? 53 | The maximum number of nodes at 3 level of a binary tree is? 54 Two binary trees are said to be coples if they have similar b ) False a) structure d) same root al a collection of related Data fieldsb) an elementary unit that stores a single fact ) a collection of related files a) random access c) both A &B a) True b) contents d) none of the above 56 A record is c) none of the above 57 Relative files can be used for b) sequential access c) None of the above S8 A sequential organued file stores the records in sorted order? b) False