Attempt HistoryAttemptTimeScoreLATESTAttempt 156 minutes30 out of 30!Correct answers will be available on Oct 8 at 12:01am.Score for this quiz: 30 out of 30Submitted Oct 4 at 5:45pmThis attempt took 56 minutes.Question 12 ptsWhat will be the height of a balanced full binary tree with 8 leaves?8564 Question 22 ptsThe balance factor of a node in a binary tree is defined asaddition of heights of left and right subtreesheight of right subtree minus height of left subtreeheight of left subtree minus height of right subtreeheight of right subtree minus oneQuestion 32 ptsA binary tree is balanced if the difference between left and rightsubtree of every node is not more thanO1320 Question 42 ptsWhich of the following is an advantage of balanced binary searchtree, like AVL tree, compared to binary heap?insertion takes less timedeletion takes less timesearching takes less timeconstruction of the tree takes less time than binary heapQuestion 52 ptsWhich of the following data structures can be efficientlyimplemented using height balanced binary search tree?setspriority queueheapboth sets and priority queue Question 62 ptsBalanced binary tree with n items allows the lookup of an item inworst-case time.O(logr n)O(nlog 2)O(n)O(1)Question 72 ptsWhich of the following tree data structures is not a balanced binarytree?AVL treeRed-black treeSplay treeB-tree Question 82 ptsWhy we need to a binary tree which is height balanced?Cto avoid formation of skew treesto save memoryto attain faster memory accessto simplify storingQuestion 92 ptsWhat maximum difference in heights between the leafs of a AVL treeis possible?log(n) where n is the number of nodesn where n is the number of nodes0 or 1atmost 1 Question 102 ptsWhat is the special property of red-black trees and what root shouldalways be?a color which is either red or black and root shouldalways be black color onlyheight of the treepointer to next nodea color which is either green or blackQuestion 112 ptsWhat are the operations that could be performed in O(logn) timecomplexity by red-black tree?Cinsertion, deletion, finding predecessor, successoronly insertiononly finding predecessor, successorfor sorting Question 122 ptsWhen it would be optimal to prefer Red-black trees over AVL trees?when there are more insertions or deletionswhen more search is neededwhen tree must be balancedwhen log(nodes) time complexity is neededQuestion 132 ptsWhy Red-black trees are preferred over hash tables though hashtables have constant time complexity?no they are not preferredbecause of resizing issues of hash table and betterordering in redblack treesbecause they can be implemented using treesbecause they are balanced Question 142 ptsA node of the weight balanced tree haskey, left and right pointers, sizekey, valuekey, sizekeyQuestion 152 ptsWhat is the condition for a tree to be weight balanced. where a isfactor and n is a node?weight[n.left] >= a*weight[n] and weight[n.right] >=a*weight[n].weight[n.left] >= a*weight[n.right] and weight[n.right]>: a*weight[n].weight[n.left] >= a*weight[n.left] and weight[n.right] >=a*weight[n].weight[n] is a non zero