State whether True or False J. In an expression tree, the operators could be at the leaf nodes. K. The deletion of a key in a BST has a higher time complexity than key search. L. A binary search tree (BST) has to be a complete binary tree. M. If a node in a BST has two children, then its Inorder successor has no left child