ment over the sequential se

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
icon
Related questions
Question

Please fill in the gaps and answer the questions. 

Binary Search Trees
1. The binary search tree provides us with a structure that allows us O(_) access to any
node in the structure - an improvement over the sequential search of a(n) _ (list which is
O(n).)
2. A binary tree is a structure in which each node is capable of having _ successor nodes,
called_. The unique starting node is called the_.
3. A_node is one that has no children. A node of a binary tree is itself the root of a
smaller tree called a_. All nodes appearing in a subtree are called _ of the root node of
the tree - conversely, the root node is called an_ of all nodes appearing below it. The
root node of a tree is said to have level _. The maximum level in a tree determines
its _ and the level contains at most _nodes.
4. In a binary search tree, what is true of all nodes in the right subtree of some given node?
5. Any node inserted in a binary search tree necessarily comes from a _ node.
6. Minimizing the height of a Binary Search Tree will maximize
7. What three cases are considered in developing the Remove function?
8. Name the three BST traversals.
9. Given the character input (M G B H S PF C), draw the BST and state the tree traversals.
10. Which BST traversal lists the info fields of the tree nodes in sorted fashion?
Consider the tree below.
11. How many subtrees are shown?
12. Insert nodes containing T and N. Redraw the tree.
13. After part 12, the trees height is _?_
14. Name the ancestors of P.
Transcribed Image Text:Binary Search Trees 1. The binary search tree provides us with a structure that allows us O(_) access to any node in the structure - an improvement over the sequential search of a(n) _ (list which is O(n).) 2. A binary tree is a structure in which each node is capable of having _ successor nodes, called_. The unique starting node is called the_. 3. A_node is one that has no children. A node of a binary tree is itself the root of a smaller tree called a_. All nodes appearing in a subtree are called _ of the root node of the tree - conversely, the root node is called an_ of all nodes appearing below it. The root node of a tree is said to have level _. The maximum level in a tree determines its _ and the level contains at most _nodes. 4. In a binary search tree, what is true of all nodes in the right subtree of some given node? 5. Any node inserted in a binary search tree necessarily comes from a _ node. 6. Minimizing the height of a Binary Search Tree will maximize 7. What three cases are considered in developing the Remove function? 8. Name the three BST traversals. 9. Given the character input (M G B H S PF C), draw the BST and state the tree traversals. 10. Which BST traversal lists the info fields of the tree nodes in sorted fashion? Consider the tree below. 11. How many subtrees are shown? 12. Insert nodes containing T and N. Redraw the tree. 13. After part 12, the trees height is _?_ 14. Name the ancestors of P.
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Threats
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.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education