University:
California State University, Northridge
Course:
COMP 182 | Data Structures and Program Design and Lab
Academic year:

2022
Views:

417

Pages:

12
Author:

NyiH

Attempt HistoryAttemptTimeScoreLATESTAttempt 152 minutes30 out of 30!Correct answers will be available on Oct 1 at 12:01am.Score for this quiz: 30 out of 30Submitted Sep 29 at 2:10pmThis attempt took 52 minutes.Question 12 ptsHow many children does a binary tree have?2any number of childreno or 1 or 20 or 1 Question 22 ptsWhat are the children for node 'W' of a complete-binary tree in anarray representation?O2w and 2w+12+w and 2-ww+1/2 and w/2w-1/2 and w+1/2 Question 32 ptsIf the tree is not a complete binary tree then what changes can bemade for easy access of children of a node in the array?every node stores data saying which of its children existin the arrayno need of any changes continue with 2w and 2w+1, ifnode is at ikeep a seperate table telling children of a nodeuse another array parallel to the array with tree Question 42 ptsCan a tree stored in an array using either one of inorder or post orderor pre order traversals be again reformed?Yes just traverse through the array and form the treeNo we need one more traversal to form a treeNo in case of sparse treesYes by using both inorder and array elements Question 52 ptsA binary tree is a rooted tree but not an ordered tree.truefalsebinary tree is a rooted tree but not an ordered tree.binary tree is a rooted tree but not an ordered tree.Question 62 ptsHow many common operations are performed in a binary tree?1234 Question 72 ptsWhat is the space complexity of the in-order traversal in therecursive fashion? (d is the tree depth and n is the number of nodes)O(1)O(nlogd)O(logd) Question 82 ptsIn a full binary tree if number of internal nodes is I, then number ofleaves L are?L= 2*IL=|+1L=|-1L = 2*1 - 1 Question 92 ptsWhat is a complete binary tree?Each node has exactly zero or two childrenA binary tree, which is completely filled, with thepossible exception of the bottom level, which is filled fromright to leftA binary tree, which is completely filled, with thepossible exception of the bottom level, which is filled fromleft to rightA tree In which all nodes have degree 2 Question 102 ptsThe number of edges from the root to the node is calledofthe tree.HeightDepthLengthWidth Question 112 ptsUsing what formula can a parent node be located in an array?(i+1)/2(i-1)/2i/22i/2Question 122 ptsIf binary trees are represented in arrays, what formula can be used tolocate a left child, if the node has an index i?2i+12i+22i4i Question 132 ptsHow many orders of traversal are applicable to a binary tree (InGeneral)?1423Question 142 ptsHow many types of insertion are performed in a binary tree?123 Question 152 ptsWhat is the traversal strategy used in the binary tree?depth-first traversalbreadth-first traversalrandom traversalPriority traversal