The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
+1 vote
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
in DS by (99 points) | 91 views

1 Answer

+1 vote
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 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
by Veteran (62.5k points)

Related questions

+1 vote
1 answer
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,092 questions
55,239 answers
85,992 users