You are given a binary tree whosekeys are integers. You need to test if this is a correc tbinary search tree. The rule is like this, the first number (firstline) will show how manynodes there will be.The following lines will have 3 integers: the key of the node (key), the index of left child and (left) and the index of right child (right). -1 means there is no child of the node. OUTPUT: If the given binary tree is a correct binary search tree, then “it is a binary search tree” will be printed. Otherwise, “it is not a binary search tree” will be printed. Example: Input 3 4-1- 2 2 -1 -1 5 -1 -1 Output: it is a binary search tree Example 2: Input: 3 5 -1- 1 7 -1 -2 9 -1 -1 Output:it is a binary search tree Use C language for writing your code
You are given a binary tree whosekeys are integers. You need to test if this is a correc tbinary search tree. The rule is like this, the first number (firstline) will show how manynodes there will be.The following lines will have 3 integers: the key of the node (key), the index of left child and (left) and the index of right child (right). -1 means there is no child of the node. OUTPUT: If the given binary tree is a correct binary search tree, then “it is a binary search tree” will be printed. Otherwise, “it is not a binary search tree” will be printed. Example: Input 3 4-1- 2 2 -1 -1 5 -1 -1 Output: it is a binary search tree Example 2: Input: 3 5 -1- 1 7 -1 -2 9 -1 -1 Output:it is a binary search tree Use C language for writing your code
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
- You are given a binary tree whosekeys are integers. You need to test if this is a correc tbinary search tree. The rule is like this, the first number (firstline) will show how manynodes there will be.The following lines will have 3 integers: the key of the node (key), the index of left child and (left) and the index of right child (right). -1 means there is no child of the node.
OUTPUT: If the given binary tree is a correct binary search tree, then “it is a binary search tree” will be printed. Otherwise, “it is not a binary search tree” will be printed.
Example: Input
3
4-1- 2
2 -1 -1
5 -1 -1
Output: it is a binary search tree
Example 2:
Input:
3
5 -1- 1
7 -1 -2
9 -1 -1
Output:it is a binary search tree
Use C language for writing your code
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 4 steps with 4 images
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