Sorted tree invariants, inorder traversal, rank queries, and strict bound checks.
Trace the Kth Smallest Element in a BST algorithm from parsed input through each decision point.
Trace the Minimum Absolute Difference in BST algorithm from parsed input through each decision point.
Trace the Validate Binary Search Tree algorithm from parsed input through each decision point.