Consider the following statements:
(I) A height of a BST(Binary Search Tree) with n nodes does not exceed log n.
(II) If a node in BST has two children, then its inorder successor has no left child and its inorder predecessor has no right child.
Which of the above statement/s is are TRUE?
1
Only I
2
Only II
3
Both I and II
4
Neither I nor II