Consider the following statements:
(i). To determine if two binary search trees are identical, we can perform inorder traversal and can compare the output list.
(ii). Maximum spanning tree can be found in \(O(ElogV)\) time.
Which of the above statement/s is are TRUE?
1
(i) only
2
(ii) only
3
Both
4
Neither