testing - Test cases for Binary Search Tree (BST) remove function using linked lists C++ -
question: test cases should use test remove function?
my thoughts:
case 1: delete when no element in system.
case 2: delete when there 1 element in system.
case 3: delete when left side of tree empty.
case 4: delete when right side of tree empty.
first, third, , fourth test cases fine. should cover case both left , right children present , both not present there more 1 element. remove need second test case.
what should out way reorder tree when have deleted item. should continue follow whatever order tree structured in.
i'm not sure mean "using linked lists"?
Comments
Post a Comment