COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Preorder traversal
|
|
|
Postorder traversal
|
|
|
Inorder traversal
|
|
|
None of the above
|
|
|
All of the above
|
Detailed explanation-1: -3. Which of the following traversing algorithm is not used to traverse in a tree? Explanation: Generally, all nodes in a tree are visited by using preorder, inorder and postorder traversing algorithms.
Detailed explanation-2: -Explanation: Breadth first traversal, also known as level order traversal is the traversal strategy used in a binary tree.
Detailed explanation-3: -Explanation: In a binary search tree, a node’s left child is always lesser than the node and right child is greater than the node, hence an in-order traversal would print them in a non decreasing fashion.
Detailed explanation-4: -Which of the following is not the self balancing binary search tree? Explanation: 2-3-4 Tree is balanced search trees. But it is not a binary tree. So, it is not a self balancing binary tree.