COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
Select all correct types of tree data structure2 answers
|
|
Binary Tree
|
|
|
Balanced Binary Tree
|
|
|
Linked Tree
|
|
|
Connected Tree
|
|
|
Directed Linked Tree
|
Explanation:
Detailed explanation-1: -Types of Tree Data Structure Binary Tree. Binary Search Tree (BST) AVL Tree. B-Tree.
Detailed explanation-2: -Adelson-Velskii and Landis (AVL) trees are binary trees which are balanced.
Detailed explanation-3: -Explanation: AVL tree is more balanced than a Red-black tree because AVL tree has less height than Red-black tree given that both trees have the same number of elements.
Detailed explanation-4: -A binary tree is balanced if the height of the tree is O(Log n) where n is the number of nodes. For Example, the AVL tree maintains O(Log n) height by making sure that the difference between the heights of the left and right subtrees is at most 1.
There is 1 question to complete.