recategorized by
586 views
0 votes
0 votes

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.

recategorized by

Please log in or register to answer this question.

Related questions

2 votes
2 votes
5 answers
1
Hardik Vagadia asked Nov 13, 2017
886 views
A 4-ary tree,i.e. each node has either 0 or 4 children tree has 20 leaf nodes. Then the total number of nodes in the tree are ____.
1 votes
1 votes
1 answer
2
1 votes
1 votes
2 answers
3
aaru14 asked Dec 7, 2017
2,350 views
assume the preorder tŕaversal of binary tree is "abc" how many total different binary trees are possible whose postorder traversal.is "cba" with the given preorder trave...