Search, insert, validate, and query ordered trees using the BST property
Insert, search, delete nodes and animate inorder, preorder, postorder traversals
Given a BST root and a target value, return the node if found, else None.
Insert a new value into a BST and return the updated root.
Check whether a binary tree satisfies the BST property at every node.
Find the kth smallest element in a BST using inorder traversal.