Binary Tree - 71: Check if given Binary Tree is BST

preview_player
Показать описание
Solution:
- We traverse the binary tree in inorder manner
- We take a global variable 'prev'.
- Now whenever we're traversing any node, we check node value with previous node value
- If current node value is less than previous value, we return false, else we keep on checking.
- We check this for all nodes in tree

Time Complexity: O(n)
Space Complexity: O(1)

Do Watch video for more info

CHECK OUT CODING SIMPLIFIED

★☆★ VIEW THE BLOG POST: ★☆★

I started my YouTube channel, Coding Simplified, during Dec of 2015.
Since then, I've published over 200+ videos.

★☆★ SUBSCRIBE TO ME ON YOUTUBE: ★☆★

★☆★ Send us mail at: ★☆★
  1. Coding Simplified
  2. Tutorial
  3. Coding
  4. Simplified
  5. Check if given Binary Tree is BST
  6. Check if given Binary Tree is Binary search tree
Рекомендации по теме
Binary Tree - 0:16:58

Binary Tree - 71: Check if given Binary Tree is BST

Computer Science for 0:05:46

Computer Science for Everyone - 71 - What is a Binary Tree?

71 - Binary 0:04:37

71 - Binary Trees: Introduction to Binary Trees

Lecture 71: Binary 0:48:19

Lecture 71: Binary SearchTree FAANG Interview Questions || Part-2

71. How to 0:14:17

71. How to Find Preorder, Postorder & Inorder of Binary Search Tree | Tree Traversal | Algorithm

L50. Binary Search 0:14:00

L50. Binary Search Tree Iterator | BST | O(H) Space

71. Binary Search 0:06:01

71. Binary Search Tree - Operation - Searching

Check If a 0:09:36

Check If a Tree is a BST Or Not | Binary Search Tree | Episode 71 | Shailesh Yogendra | DSA with C++

Coding Challenge #65.1: 0:39:07

Coding Challenge #65.1: Binary Search Tree

71. Binary Tree 0:11:54

71. Binary Tree Traversing - Inorder, Preorder, Postorder | Data Structures

Checking if a 0:16:25

Checking if a binary tree is a binary search tree or not!

GATE 2015 | 0:02:10

GATE 2015 | Binary Search Tree

Convert Sorted Array 0:09:54

Convert Sorted Array to Binary Search Tree - Leetcode 108 - Python

Check if a 0:07:15

Check if a tree is bst or not

Binary Search examples 0:08:23

Binary Search examples | Successful search | Design & Algorithms | Lec-13 | Bhanu Priya

construction of binary 0:05:25

construction of binary search tree with example|binary search tree example step by step

L41. Ceil in 0:05:36

L41. Ceil in a Binary Search Tree | BST | C++ | Java

LeetCode 108. Convert 0:08:31

LeetCode 108. Convert Sorted Array to Binary Search Tree - Interview Prep Ep 71

Session #71 on 0:59:25

Session #71 on Coding interview readiness and Binary Search Tree

Two Sum in 0:07:28

Two Sum in BST | Pair Sum in BST | Two sum Problem in Binary Search Tree | DSA-One Course #71

Validate Binary Search 0:16:44

Validate Binary Search Tree | Check If a Binary Tree is BST or Not | Java

LeetCode 98. Validate 0:09:48

LeetCode 98. Validate Binary Search Tree (Algorithm Explained)

4.6.2 [New] Optimal 0:57:00

4.6.2 [New] Optimal Binary Search Tree Successful and Unsuccessful Probability - Dynamic Programming

Binary tree - 0:08:03

Binary tree - 39: Create Double tree of given Binary Tree

Комментарии
Автор

Plz make a series on recursion problems as well.

divanshmahajan
Автор

why are we checking !isBST and returning false. Can't we do isBST and return true?

rahulsaxena
Автор

in code you write node.data < prev.data what about prev.data > node.data??

ABHISHEKAnand-utfq
Автор

Really enjoyed learning part of BST from you

randomperson
Автор

I got only false and I have no idea where did I go wrong.

RizaHariati
Автор

SIR plz make video on searching, sorting technique using java

rohitpawar
Автор

Most Underrated channel
Great explanation bro.

uditkhanna
Автор

Hey. First of all great content again.
Secondly don't you think that the condition should have been prev.data>=node.data,
since binary search tree does not allows duplicate values.
In case of a tree with all one's the the output coming is true where as it's not a BST.
Just a suggestion that's it bro.

uditkhanna
welcome to shbcf.ru