True / False:-
1. : The difference between the number of nodes in a binary tree that have exactly two children and the number of leaf nodes is 1
2. Deletion of root of AVL tree will take O(n) time so that, resulted tree also have property of AVL tree.
I think first is false and second is true.. Because in first it should be -1 and in second it is correct as we can do in logn so o(n) is also correct.
Given answer is : 1 is true and second is false.