.png){kind=logo}
MET CS 526 T F Final Study Update -
Assume that class T is a subclass of class S in Java. Then, we can have an instance method in T whose name and signature are the same as the name and the signature of
an instance method in S. - CORRECT ANSWER: True
In a tree data structure, A node n is an ancestor of the node n itself. - CORRECT
ANSWER: True
In a tree data structure, A tree is ordered if there is a meaningful order between a node
and its parent. - CORRECT ANSWER: false
In a tree data structure, If (m, n) is an edge in a tree, then either m is the parent of n or n
is the parent of m. - CORRECT ANSWER: false
In a tree data structure, We can visit all nodes of a general tree using the inorder tree
traversal. - CORRECT ANSWER: false
In binary trees, The height of a binary tree is at least log(n+1) , where h is the height of
a binary tree and n is the number of nodes in a binary tree. - CORRECT ANSWER:
false
In binary trees, The number of external nodes in a binary tree is at most 2h, where h is the height of a binary tree and n is the number of nodes in a binary tree. - CORRECT
ANSWER: true
In binary trees, The number of internal nodes in a binary tree is at least h , where h is the height of a binary tree and n is the number of nodes in a binary tree. - CORRECT
ANSWER: true
In binary trees, The number of nodes in a binary tree is at most 2h+1 , where h is the height of a binary tree and n is the number of nodes in a binary tree. - CORRECT
ANSWER: false
In graphs, A simple graph does not have parallel edges or self-loops. - CORRECT
ANSWER: true
In graphs, If a graph G is a forest, then there is no cycle in G. - CORRECT ANSWER: true
In graphs, In a connected, directed graph, every node is reachable from all other nodes.
- CORRECT ANSWER: false
- / 1
.png)