COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Balanced Tree
|
|
|
Perfect Tree
|
|
|
Right Tree
|
|
|
Unbalanced Tree
|
Detailed explanation-1: -A balanced binary tree is one in which no leaf nodes are ‘too far’ from the root. For example, one definition of balanced could require that all leaf nodes have a depth that differ by at most 1. An unbalanced binary tree is one that is not balanced.
Detailed explanation-2: -A good example of an unbalanced tree is one where all the data is overwhelmingly either greater than or less than the root node. In the tree illustrated here, the values of the all the child nodes that were added to this binary search tree are smaller than the root node, 20 .
Detailed explanation-3: -This technique follows the ‘root left right’ policy. It means that, first root node is visited after that the left subtree is traversed recursively, and finally, right subtree is recursively traversed. As the root node is traversed before (or pre) the left and right subtree, it is called preorder traversal.
Detailed explanation-4: -Max-Heap − Where the value of the root node is greater than or equal to either of its children.