Deck 19: Binary Trees

Full screen (f)
exit full mode
Question
Define a directed branch.
Use Space or
up arrow
down arrow
to flip the card.
Question
Each node in a binary tree can have at most ____________________ link(s).
Question
A shallow copy tree has the same number of nodes as the original binary tree.
Question
What are the three primary steps in the preorder traversal algorithm?
Question
Both the average number of nodes visited and the number of key comparisons in a search of a binary search tree is O(____________________).
Question
Explain the difference between a binary tree and a binary search tree.
Question
What does these terms refer to:

- \gg AVL-tree:
Question
What does these terms refer to:

- \gg Binary tree:
Question
What does these terms refer to:

- \gg Binary search tree:
Question
What does these terms refer to:

- \gg Branch:
Question
What does these terms refer to:

- \gg Breadth first traversal:
Question
What does these terms refer to:

- \gg Height:
Question
What does these terms refer to:

- \gg Inorder sequence:
Question
What does these terms refer to:

- \gg Leaf:
Question
What does these terms refer to:

- \gg Left child:
Question
What does these terms refer to:

- \gg Left subtree:
Question
What does these terms refer to:

- \gg Length:
Question
What does these terms refer to:

- \gg Level:
Question
What does these terms refer to:

- \gg Level-by-level:
Question
What does these terms refer to:

- \gg Parent:
Question
What does these terms refer to:

- \gg Path:
Question
What does these terms refer to:

- \gg Postorder sequence:
Question
What does these terms refer to:

- \gg Preorder sequence:
Question
What does these terms refer to:

- \gg Right child:
Question
What does these terms refer to:

- \gg Right subtree:
Question
What does these terms refer to:

- \gg Root:
Unlock Deck
Sign up to unlock the cards in this deck!
Unlock Deck
Unlock Deck
1/26
auto play flashcards
Play
simple tutorial
Full screen (f)
exit full mode
Deck 19: Binary Trees
1
Define a directed branch.
A directed branch is an arrow from a parent node to a child node; it is also called a directed edge or branch.
2
Each node in a binary tree can have at most ____________________ link(s).
two
3
A shallow copy tree has the same number of nodes as the original binary tree.
False
4
What are the three primary steps in the preorder traversal algorithm?
Unlock Deck
Unlock for access to all 26 flashcards in this deck.
Unlock Deck
k this deck
5
Both the average number of nodes visited and the number of key comparisons in a search of a binary search tree is O(____________________).
Unlock Deck
Unlock for access to all 26 flashcards in this deck.
Unlock Deck
k this deck
6
Explain the difference between a binary tree and a binary search tree.
Unlock Deck
Unlock for access to all 26 flashcards in this deck.
Unlock Deck
k this deck
7
What does these terms refer to:

- \gg AVL-tree:
Unlock Deck
Unlock for access to all 26 flashcards in this deck.
Unlock Deck
k this deck
8
What does these terms refer to:

- \gg Binary tree:
Unlock Deck
Unlock for access to all 26 flashcards in this deck.
Unlock Deck
k this deck
9
What does these terms refer to:

- \gg Binary search tree:
Unlock Deck
Unlock for access to all 26 flashcards in this deck.
Unlock Deck
k this deck
10
What does these terms refer to:

- \gg Branch:
Unlock Deck
Unlock for access to all 26 flashcards in this deck.
Unlock Deck
k this deck
11
What does these terms refer to:

- \gg Breadth first traversal:
Unlock Deck
Unlock for access to all 26 flashcards in this deck.
Unlock Deck
k this deck
12
What does these terms refer to:

- \gg Height:
Unlock Deck
Unlock for access to all 26 flashcards in this deck.
Unlock Deck
k this deck
13
What does these terms refer to:

- \gg Inorder sequence:
Unlock Deck
Unlock for access to all 26 flashcards in this deck.
Unlock Deck
k this deck
14
What does these terms refer to:

- \gg Leaf:
Unlock Deck
Unlock for access to all 26 flashcards in this deck.
Unlock Deck
k this deck
15
What does these terms refer to:

- \gg Left child:
Unlock Deck
Unlock for access to all 26 flashcards in this deck.
Unlock Deck
k this deck
16
What does these terms refer to:

- \gg Left subtree:
Unlock Deck
Unlock for access to all 26 flashcards in this deck.
Unlock Deck
k this deck
17
What does these terms refer to:

- \gg Length:
Unlock Deck
Unlock for access to all 26 flashcards in this deck.
Unlock Deck
k this deck
18
What does these terms refer to:

- \gg Level:
Unlock Deck
Unlock for access to all 26 flashcards in this deck.
Unlock Deck
k this deck
19
What does these terms refer to:

- \gg Level-by-level:
Unlock Deck
Unlock for access to all 26 flashcards in this deck.
Unlock Deck
k this deck
20
What does these terms refer to:

- \gg Parent:
Unlock Deck
Unlock for access to all 26 flashcards in this deck.
Unlock Deck
k this deck
21
What does these terms refer to:

- \gg Path:
Unlock Deck
Unlock for access to all 26 flashcards in this deck.
Unlock Deck
k this deck
22
What does these terms refer to:

- \gg Postorder sequence:
Unlock Deck
Unlock for access to all 26 flashcards in this deck.
Unlock Deck
k this deck
23
What does these terms refer to:

- \gg Preorder sequence:
Unlock Deck
Unlock for access to all 26 flashcards in this deck.
Unlock Deck
k this deck
24
What does these terms refer to:

- \gg Right child:
Unlock Deck
Unlock for access to all 26 flashcards in this deck.
Unlock Deck
k this deck
25
What does these terms refer to:

- \gg Right subtree:
Unlock Deck
Unlock for access to all 26 flashcards in this deck.
Unlock Deck
k this deck
26
What does these terms refer to:

- \gg Root:
Unlock Deck
Unlock for access to all 26 flashcards in this deck.
Unlock Deck
k this deck
locked card icon
Unlock Deck
Unlock for access to all 26 flashcards in this deck.