algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-27 22:43:30 +08:00
Code Issues Packages Projects Releases Wiki Activity

Valid BST: refactoring + added unit test (#3883)

Browse Source 
Co-authored-by: Debasish Biswas <debasishbsws.abc@gmail.com>
This commit is contained in:
Albina Gimaletdinova
2023-02-17 14:43:17 +03:00
committed by GitHub
parent d565edc69a
commit 541f490d1e
2 changed files with 72 additions and 28 deletions
Download Patch File Download Diff File Expand all files Collapse all files

61
src/test/java/com/thealgorithms/datastructures/trees/ValidBSTOrNotTest.java Normal file
View File

@ -0,0 +1,61 @@
package com.thealgorithms.datastructures.trees;
import org.junit.jupiter.api.Test;
import static org.junit.jupiter.api.Assertions.assertFalse;
import static org.junit.jupiter.api.Assertions.assertTrue;
/**
* @author Albina Gimaletdinova on 17/02/2023
*/
public class ValidBSTOrNotTest {
@Test
public void testRootNull() {
assertTrue(ValidBSTOrNot.isBST(null));
}
@Test
public void testOneNode() {
final BinaryTree.Node root = TreeTestUtils.createTree(new Integer[]{Integer.MIN_VALUE});
assertTrue(ValidBSTOrNot.isBST(root));
}
/*
9
/ \
7 13
/\ / \
3 8 10 20
*/
@Test
public void testBinaryTreeIsBST() {
final BinaryTree.Node root = TreeTestUtils.createTree(new Integer[]{9, 7, 13, 3, 8, 10, 20});
assertTrue(ValidBSTOrNot.isBST(root));
}
/*
9
/ \
7 13
/\ / \
3 8 10 13 <--- duplicated node
*/
@Test
public void testBinaryTreeWithDuplicatedNodesIsNotBST() {
final BinaryTree.Node root = TreeTestUtils.createTree(new Integer[]{9, 7, 13, 3, 8, 10, 13});
assertFalse(ValidBSTOrNot.isBST(root));
}
/*
9
/ \
7 13
/\ / \
3 8 10 12 <---- violates BST rule, needs to be more than 13 (parent node)
*/
@Test
public void testBinaryTreeIsNotBST() {
final BinaryTree.Node root = TreeTestUtils.createTree(new Integer[]{9, 7, 13, 3, 8, 10, 12});
assertFalse(ValidBSTOrNot.isBST(root));
}
}