Binary Search Tree (BST) | Part-2/2 | DS | Data Structures | Lec-34 | Bhanu Priya

[@kethavathganesh1133]

Ma'am as you said in previous video that the left sub tree, the right value is greater then the root of left sub tree it is not a binary search tree

[@punitmishra3365]

In part 1 of BST u said that subtree's right and left don't matter. Which is correct?

[@Codebotics]

you explained the ist example in wrong way.There the left subtree is satisfying the condition but the right subtree of the right side is less than root ,which should be greater as per the rule...that why it is not a binary search tree

[@prakashpanda2702]

Thanks mam it's my doubts

[@037_sayedramishali7]

Explain terms in algo properly please