gs gs121 Binary Trees - Inorder Traversal - Quiz No.1
gs gs121 Data Structures and Algorithms Quiz
This quiz belongs to book/course code gs gs121 Data Structures and Algorithms of gs organization. We have 169 quizzes available related to the book/course Data Structures and Algorithms. This quiz has a total of 8 multiple choice questions (MCQs) to prepare and belongs to topic Binary Trees. NVAEducation wants its users to help them learn in an easy way. For that purpose, you are free to prepare online MCQs and quizzes.
NVAEducation also facilitates users to contribute in online competitions with other students to make a challenging situation to learn in a creative way. You can create one to one, and group competition on an topic of a book/course code. Also on NVAEducation you can get certifications by passing the online quiz test.
Question 1: For the tree below, write the in-order traversal.
6, 2, 5, 7, 11, 2, 5, 9, 4
6, 5, 2, 11, 7, 4, 9, 5, 2
2, 7, 2, 6, 5, 11, 5, 9, 4
2, 7, 6, 5, 11, 2, 9, 5, 4
Question 2: For the tree below, write the level-order traversal.
2, 7, 2, 6, 5, 11, 5, 9, 4
2, 7, 5, 2, 11, 9, 6, 5, 4
2, 5, 11, 6, 7, 4, 9, 5, 2
2, 7, 5, 6, 11, 2, 5, 4, 9
Question 3: Select the code snippet which performs in-order traversal.
public void inorder(Tree root) { System.out.println(root.data); inorder(root.left); inorder(root.right); } public void inorder(Tree root) { inorder(root.left); System.out.println(root.data); inorder(root.right); } public void inorder(Tree root) { System.out.println(root.data); inorder(root.right); inorder(root.left); } public void inorder(Tree root) { inorder(root.right); inorder(root.left); System.out.println(root.data); }
Question 4: Select the code snippet which performs level-order traversal.
public static void levelOrder(Tree root) { Queue<Node> queue=new LinkedList<Node>(); queue.add(root); while(!queue.isEmpty()) { Node tempNode=queue.poll(); System.out.println("%d ",tempNode.data); if(tempNode.left!=null) queue.add(tempNode.left); if(tempNode.right!=null) queue.add(tempNode.right); } } public static void levelOrder(Tree root) { Queue<Node> queue=new LinkedList<Node>(); queue.add(root); while(!queue.isEmpty()) { Node tempNode=queue.poll(); System.out.println("%d ",tempNode.data); if(tempNode.left!=null) queue.add(tempNode.right); if(tempNode.right!=null) queue.add(tempNode.left); } } public static void levelOrder(Tree root) { Queue<Node> queue=new LinkedList<Node>(); queue.add(root); while(!queue.isEmpty()) { Node tempNode=queue.poll(); System.out.println("%d ",tempNode.data); if(tempNode.right!=null) queue.add(tempNode.left); if(tempNode.left!=null) queue.add(tempNode.right); } } public static void levelOrder(Tree root) { Queue<Node> queue=new LinkedList<Node>(); queue.add(root); while(!queue.isEmpty()) { Node tempNode=queue.poll(); System.out.println("%d ",tempNode.data); if(tempNode.right!=null) queue.add(tempNode.left.left); if(tempNode.left!=null) queue.add(tempNode.right.right); } }
Question 6: What is the time complexity of level order traversal?
O(1)
O(n)
O(logn)
O(nlogn)
Question 7: Which of the following graph traversals closely imitates level order traversal of a binary tree?
Depth First Search
Breadth First Search
Depth & Breadth First Search
Binary Search
Question 8: In a binary search tree, which of the following traversals would print the numbers in the ascending order?
Level-order traversal
Pre-order traversal
Post-order traversal
In-order traversal
Online Quizzes of gs121 Data Structures and Algorithms
Binary Trees - Binary Search Tree - Quiz No.1
gs gs121
Data Structures and Algorithms Online Quizzes
Binary Trees - Binary Search Tree - Quiz No.2
gs gs121
Data Structures and Algorithms Online Quizzes
Binary Trees - Preorder Traversal - Quiz No.1
gs gs121
Data Structures and Algorithms Online Quizzes
