FiltersDone

Question type

Essay

Multiple Choice

Short Answer

True False

Matching

Exam 10: Trees

Show Answer

Share

---

All types

Filters

Study FlashcardsPractice ExamLearn

Question 1

Multiple Choice

Review LaterAdd Note

Review Later

Which of the following is described as a node's parent, its parent's parent, and so on up to the root?

A) descendant
B) path
C) depth
D) ancestor

E) None of the above
F) A) and B)

Correct Answer

verified

Show Answer

Question 2

True/False

Review LaterAdd Note

Review Later

A parse tree describes the syntactic structure of a sentence in terms of its component parts.

A) True
B) False

Correct Answer

verified

Show Answer

Question 3

True/False

Review LaterAdd Note

In a tree, an interior node is a node that has no children.

Which of the following is the topmost node in a tree and does not have a parent?

Which of the following is NOT a common application for a binary tree?

The heap sort algorithm builds a heap from a set of data and then repeatedly removes the leaf item and adds it to the end of a list.

In the code for the add method in the implementation of a heap, what is the missing code? def add(self, item) : Self.size += 1 Self.heap.append(item) CurPos = len(self.heap) - 1 While curPos > 0: Parent = (curPos - 1) // 2 ParentItem = self.heap[parent] If parentItem <= item: < missing code > Else: Self.heap[curPos] = self.heap[parent] Self.heap[parent] = item CurPos = parent

Because the recursive search algorithm doesn't require a parameter for a tree node, you can define it as a top-level method.

In the replace method for a binary search tree interface, None is returned if the first argument cannot be found.

You should use a postorder iteration method for the tree's __iter__ method to enable the user to create a clone of the tree with the same shape as the original.

Which symbol type is NOT found in an EBNF?

Syntax rules specify how sentences in the language should be interpreted.

One of the types of symbols used by an EBNF is metasymbols.

The level order traversal guides the visits to items from left to right through the levels of the tree, much like reading lines of text in a document.

In the following code for the find method, what is the missing code? def find(self, item) : Def recurse(node) : If node is None: Return None Elif item == node.data: < missing code > Elif item < node.data: Return recurse(node.left) Else: Return recurse(node.right) Return recurse(self.root)

In a tree, which of the following is true?

A grammar in a programming language consists of a vocabulary, syntax rules, and a list of operators.

Two trees are considered equal if they contain the same items in the same positions.

In the code for the inorder method for a binary search tree, what is the missing code? def inorder(self) : Lyst = list() Def recurse(node) : If node != None: < missing code > Lyst.append(node.data) Recurse(node.right) Recurse(self.root) Return iter(lyst)

The height of an empty tree is -1.