List of top Computer Science Questions on Binary Search Tree asked in CUET (PG)

The set T represents various traversals over a binary tree. The set S represents the order of visiting nodes during a traversal. Which one of the following is the correct match from T to S?
In case of Binary Search Tree, which of the following procedure's running time is distinct among all?
In a binary search tree, the worst case time complexity of inserting and deleting a key is: