Match the term with each definition:
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
Match the term with each definition:
In a binary tree, the left child (if any) of a node plus its descendants
|
|
|
The number of nodes on the longest path from the root to a leaf
|
|
A node on a path from a node to a leaf
|
|
Set of nodes, T, such that either T is empty or T is partitioned into three disjoint sets (a single node r, called the root, and two (possibly empty) sets that are binary trees, called left and right subtrees of T).
|
|
A binary tree such that for any given data item, x, in the tree, every node in the left subtree of x contains only items less than x. Every node in the right subtree of x contain only items greater than x.
|
|
Nodes which have the same parent
|
|
A node on the path from the root to a node
|
|
A node directly "above" a node in the tree
|
|
The node in a tree that has no parent
|
|
If the node is the root, then the value is one. Otherwise, it's the value of one greater than the value of its parent
|
|
A tree with the maximum difference in height of one between any two subtrees of a node
|
|
A tree that consists of a node and its descendants (if any)
|
|
A node directly "below" a node in the tree
|
|
A binary tree which has all possible nodes in the last level
|
|
A node directly "below" and to the left of a node in a binary tree
|
|
A node that has no children
|
|
A set of one or more nodes, partitioned into a root node and subsets that are general subtrees of the root
|
|
A binary tree with no nodes
|
|
A tree which has all possible nodes down to the second to last level, with the last level filled in from left to right
|
Question 1 options:
1. |
Ancestor
|
2. |
Balanced binary tree
|
3. |
Binary search tree
|
4. |
Binary tree
|
5. |
Child
|
6. |
Complete binary tree
|
7. |
Descendant
|
8. |
Empty binary tree
|
9. |
Full binary tree
|
10. |
General tree
|
11. |
Height
|
12. |
Leaf
|
13. |
Left child
|
14. |
Left subtree
|
15. |
Level
|
16. |
Parent
|
17. |
Root
|
18. |
Siblings
|
19. |
Subtree
|
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education