The grader's test scenarios will cover all or most of the required program code (this chiefly consists of required constructors and required instance methods per the ADT)
Be very careful to avoid blocker bugs. They can turn awesome code into non-runnable zero-scoring code.
Note that 85% of the scoring does not require a self-balancing tree (see related tip under Coding Tips)
Scoring Weights
Method
Scoring Weight
search
20%
add
20%
removeKey
10%
size
6%
visitInOrder
6%
visitPreOrder
6%
visitPostOrder
6%
isEmpty
3%
height
5%
containsKey
3%
maintaining tree balance (self auto re-balancing)
15%
Data Structures And Algorithms (DSA)
(Chapter 704 - BST Coding Challenge)