862 views
1 votes
1 votes
which is an efficient tree structure in terms of space and time complexity?

a) AVL Tree

b)Full Binary tree

c)Complete binary tree

d)Binary tree

1 Answer

3 votes
3 votes
in terms of space, complete binary tree is efficient

therefore option B and D are eliminated, but option A can't, due to it is also a type of complete binary tree

W.r.to Time complexity, AVL is better than Complete Binary tree

due to it is BST and operations like insertion, deletion and search can be performed in O(log N) time

Option A is right

Related questions

2 votes
2 votes
5 answers
2
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
3