Trees: Is This a Binary Search Tree?
Problem Statement :
For the purposes of this challenge, we define a binary search tree to be a binary tree with the following properties: The data value of every node in a node's left subtree is less than the data value of that node. The data value of every node in a node's right subtree is greater than the data value of that node. The data value of every node is distinct. For example, the image on the left below is a valid BST. The one on the right fails on several counts: - All of the numbers on the right branch from the root are not larger than the root. - All of the numbers on the right branch from node 5 are not larger than 5. - All of the numbers on the left branch from node 5 are not smaller than 5. - The data value 1 is repeated. Function Description Complete the function checkBST in the editor below. It must return a boolean denoting whether or not the binary tree is a binary search tree. checkBST has the following parameter(s): root: a reference to the root node of a tree to test Input Format You are not responsible for reading any input from stdin. Hidden code stubs will assemble a binary tree and pass its root node to your function as an argument. Constraints 0 <= data <= 10^4 Output Format Your function must return a boolean true if the tree is a binary search tree. Otherwise, it must return false.
Solution :
Solution in C++ :
In C++ :
struct Node {
int data;
Node* left;
Node* right;
}
*/
bool soy=true;
int mini(int a, int b)
{
return a<b ? a:b;
}
int maxi(int a, int b)
{
return a>b ? a:b;
}
typedef pair<int, int> ii;
#define f first
#define s second
ii revisar(Node* root)
{
ii h(-1, 10005), iz(10005,10005), de(-1,-1);
if (root->left!=NULL)
{
iz=revisar(root->left);
if (iz.s >= root->data or iz.f >= root->data) soy=false;
}
if (root->right!=NULL)
{
de=revisar(root->right);
if (de.f <= root->data or de.s <= root->data) soy=false;
}
return ii{mini(root->data, iz.f),maxi(root->data, de.s) };
}
bool checkBST(Node* root) {
soy=true;
if (root!=NULL)
revisar(root);
//else return false;
return soy;
}
Solution in Java :
In Java :
class Node {
int data;
Node left;
Node right;
}
*/
boolean checkBST(Node root) {
//return fasle;
return checkBSTHelper(root, Integer.MIN_VALUE, Integer.MAX_VALUE);
}
private boolean checkBSTHelper(Node n, int min, int max) {
if (n == null) return true;
if (n.data <= min || n.data >= max) return false;
return checkBSTHelper(n.left, min, n.data) && checkBSTHelper(n.right, n.data, max);
}
Solution in Python :
In Python3 :
""" Node is defined as
class node:
def __init__(self, data):
self.data = data
self.left = None
self.right = None
"""
def check(node, max_val = float('inf'), min_val = float('-inf')):
if not node:
return True
if node.data <= min_val or node.data >= max_val:
return False
return check(node.left, node.data, min_val) and check(node.right, max_val, node.data)
def check_binary_search_tree_(root):
return check(root)
View More Similar Problems
Delete duplicate-value nodes from a sorted linked list
This challenge is part of a tutorial track by MyCodeSchool You are given the pointer to the head node of a sorted linked list, where the data in the nodes is in ascending order. Delete nodes and return a sorted list with each distinct value in the original list. The given head pointer may be null indicating that the list is empty. Example head refers to the first node in the list 1 -> 2 -
View Solution →Cycle Detection
A linked list is said to contain a cycle if any node is visited more than once while traversing the list. Given a pointer to the head of a linked list, determine if it contains a cycle. If it does, return 1. Otherwise, return 0. Example head refers 1 -> 2 -> 3 -> NUL The numbers shown are the node numbers, not their data values. There is no cycle in this list so return 0. head refer
View Solution →Find Merge Point of Two Lists
This challenge is part of a tutorial track by MyCodeSchool Given pointers to the head nodes of 2 linked lists that merge together at some point, find the node where the two lists merge. The merge point is where both lists point to the same node, i.e. they reference the same memory location. It is guaranteed that the two head nodes will be different, and neither will be NULL. If the lists share
View Solution →Inserting a Node Into a Sorted Doubly Linked List
Given a reference to the head of a doubly-linked list and an integer ,data , create a new DoublyLinkedListNode object having data value data and insert it at the proper location to maintain the sort. Example head refers to the list 1 <-> 2 <-> 4 - > NULL. data = 3 Return a reference to the new list: 1 <-> 2 <-> 4 - > NULL , Function Description Complete the sortedInsert function
View Solution →Reverse a doubly linked list
This challenge is part of a tutorial track by MyCodeSchool Given the pointer to the head node of a doubly linked list, reverse the order of the nodes in place. That is, change the next and prev pointers of the nodes so that the direction of the list is reversed. Return a reference to the head node of the reversed list. Note: The head node might be NULL to indicate that the list is empty.
View Solution →Tree: Preorder Traversal
Complete the preorder function in the editor below, which has 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's preorder traversal as a single line of space-separated values. Input Format Our test code passes the root node of a binary tree to the preOrder function. Constraints 1 <= Nodes in the tree <= 500 Output Format Print the tree's
View Solution →