You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The newly created node will become head of the linked list. · Size of the list is increased by one.
@@ -647,12 +652,9 @@ Trade off or invest some memory to improve run time complexity. Suppose use Has-
647
652
648
653
[Answer for Creating Minimal Tree Interview Question](src/interview-questions/graph/2-minimal-bs-tree.mjs)
649
654
655
+
#### Check if a given binary tree is BST ( Binary Search Tree )
650
656
651
-
#### Check if a given binary tree is BST ( Binary Search Tree )
652
-
653
-
**Binary Search Tree (BST)**: is a binary tree in which for each node value of all the nodes in the left subtree is lesser or equal to the root node. And the values of all the nodes in the right subtree is greater than the root node.
654
-
655
-
657
+
**Binary Search Tree (BST)**: is a binary tree in which for each node value of all the nodes in the left subtree is lesser or equal to the root node. And the values of all the nodes in the right subtree is greater than the root node.
0 commit comments