multiple choice a. The key value of each node in BST is unique b. The value of root node is the Minimal in whole tree c. The keys (if any) in the left subtree are larger than the key in the root d. The keys (if any) in the right subtree are smaller than the key in the root ☐e. BST is a binary tree

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
The following description to Binary Search Tree(BST), which is not correct?
multiple choice
a. The key value of each node in BST is unique
☐ b. The value of root node is the Minimal in whole tree
c. The keys (if any) in the left subtree are larger than the key in the root
d. The keys (if any) in the right subtree are smaller than the key in the root
☐e. BST is a binary tree
f. The keys (if any) in the children subtree are smaller than the key in the root
g. BST is a complete binary tree
☐ h. The keys (if any) in the left subtree are smaller than the key in the root
i. The value of root node is the Maximal in whole tree
j. BST is a Tree
k. The keys (if any) in the right subtree are larger than the key in the root
1. The keys (if any) in the left subtree are no larger than the key in the root
□ m. The keys (if any) in the right subtree are no smaller than the key in the root
n. The value of root node is the average value for whole tree
o. Empty is a BST
Op. BST may
be formed as a Skewed Binary Tree
Transcribed Image Text:The following description to Binary Search Tree(BST), which is not correct? multiple choice a. The key value of each node in BST is unique ☐ b. The value of root node is the Minimal in whole tree c. The keys (if any) in the left subtree are larger than the key in the root d. The keys (if any) in the right subtree are smaller than the key in the root ☐e. BST is a binary tree f. The keys (if any) in the children subtree are smaller than the key in the root g. BST is a complete binary tree ☐ h. The keys (if any) in the left subtree are smaller than the key in the root i. The value of root node is the Maximal in whole tree j. BST is a Tree k. The keys (if any) in the right subtree are larger than the key in the root 1. The keys (if any) in the left subtree are no larger than the key in the root □ m. The keys (if any) in the right subtree are no smaller than the key in the root n. The value of root node is the average value for whole tree o. Empty is a BST Op. BST may be formed as a Skewed Binary Tree
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Types of trees
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