Question 1 (1 point) The ______ is a position-oriented ADT that is not linear. Q

Question

Question 1 (1 point)

The ______ is a position-oriented ADT that is not linear.

Question 1 options:

sorted list

queue

binary tree

list

Save

Question 2 (1 point)

The node of a tree that has no parent is called a(n) ______.

Question 2 options:

sibling

root

leaf

orphan

Save

Question 3 (1 point)

The lines between the nodes of a tree are called ______.

Question 3 options:

branches

edges

arches

subtrees

Save

Question 4 (1 point)

The node that is directly above node n in a tree is called the ______ of node n.

Question 4 options:

root

leaf

parent

child

Save

Question 5 (1 point)

A node directly below node n in a tree is called a ______ of node n.

Question 5 options:

root

leaf

parent

child

Save

Question 6 (1 point)

In a tree, the children of the same parent are called ______.

Question 6 options:

leafs

siblings

roots

contemporaries

Save

Question 7 (1 point)

Each node in a tree has ______.

Question 7 options:

exactly one parent

at most one parent

exactly one leaf

at most two leaves

Save

Question 8 (1 point)

A node on the path from the root to node n is a(n) ______ of node n.

Question 8 options:

ancestor

descendant

subtree

leaf

Save

Question 9 (1 point)

A descendant of node n is a node on a path from node n to ______.

Question 9 options:

the root

a leaf

a sibling of node n

a child of node n

Save

Question 10 (1 point)

A subtree of node n is a subtree rooted at ______.

Question 10 options:

node n

the parent of node n

a child of node n

a sibling of node n

Save

Question 11 (1 point)

The ______ of a tree is the number of nodes on the longest path from the root to a leaf.

Question 11 options:

height

length

depth

balance

Save

Question 12 (1 point)

In a ______ of height h, all nodes that are at a level less than h have two children each.

Question 12 options:

general tree

binary tree

full binary tree

complete binary tree

Save

Question 13 (1 point)

A ______ of height h is full down to level h – 1, with level h filled in from left to right.

Question 13 options:

full binary tree

complete binary tree

balanced binary tree

general tree

sorted list

queue

binary tree

list

Explanation / Answer

question 1:BINARY TREE

question 2:ROOT

question 3:EDGES

question 4:PARENT

question 5:CHILD

question 6:SIBLINGS

question 7:ATMOST ONE PARENT

question 8:DESCENDANT

question 9:ACHILD OF NODE N

question 10:A CHILD OF NODE N

question 11:HEIGHT

question 12:Full BINARY TREE

question 13:BALANCED BINARY TREE

Related Questions

Navigate

• Browse (All)
• Browse Q
• Subjects

---