5 years ago in UGC CS - December 2012

# In which tree, for every node the height of its left subtree and right subtree differ almost by one ?

[A] Binary search tree
[B] AVL tree
[D] Complete Binary Tree

## Overall Stats

Attempted 17
Correct 6
Incorrect 7
Viewed 4

Srusti Lingaraju - 1 month ago

Srusti Lingaraju is saying AVL tree is correct answer

Raghuveer Dhakad - 2 years ago

Raghuveer Dhakad from Delhi, India is saying AVL tree is correct answer

Mushkin - 2 years ago

Mushkin from Anantapur, India is saying Binary search tree is correct answer

suresh 1547 - 2 years ago

suresh 1547 from India is saying AVL tree is correct answer

purushotham - 2 years ago

purushotham from India is saying Binary search tree is correct answer

## Related Questions

### Component Level Design is concerned with

• [A] Flow Oriented Analysis
• [B] Class Based Analysis
• [C] Both of the above
• [D] None of the above

### In which tree, for every node the height of its left sub-tree and right sub-tree differ almost by one?

• [A] Binary Search Tree
• [B] AVL Tree
• [D] Complete Binary Tree

### ______ is an 'umbrellaâ€ activity that is applied throughout the software engineering process.

• [A] Debugging
• [B] Testing
• [C] Designing
• [D] Software quality assurance

### The GSM network is divided into the following three major systems :

• [A] SS, BSS, OSS
• [B] BSS, BSC, MSC
• [C] CELL, BSC, OSS
• [D] SS, CELL, MSC

### AES is a round cipher based on the Rijndal Algorithm that uses a 128-bit block of data. AES has three different configurations. ______ rounds with a key size of 128 bits, ______ rounds with a key size of 192 bits and ______ rounds with a key size of 256 bits.

• [A] 5, 7, 15
• [B] 10, 12, 14
• [C] 5, 6, 7
• [D] 20, 12, 14