gs gs121 Binary Trees - Binary Search Tree - 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 10 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: Which of the following is false about a binary search tree?
The left child is always lesser than its parent
The right child is always greater than its parent
The left and right sub-trees should also be binary search trees
In order sequence gives decreasing order of elements
Question 2: How to search for a key in a binary search tree?
public Tree search(Tree root, int key) { if( root == null || root.key == key ) { return root; } if( root.key < key ) { return search(root.right,key); } else return search(root.left,key); } public Tree search(Tree root, int key) { if( root == null || root.key == key ) { return root; } if( root.key < key ) { return search(root.left,key); } else return search(root.right,key); } public Tree search(Tree root, int key) { if( root == null) { return root; } if( root.key < key ) { return search(root.right,key); } else return search(root.left,key); } public Tree search(Tree root, int key) { if( root == null) { return root; } if( root.key < key ) { return search(root.right.right,key); } else return search(root.left.left,key); }
Question 3: What is the speciality about the inorder traversal of a binary search tree?
It traverses in a non increasing order
It traverses in an increasing order
It traverses in a random fashion
It traverses based on priority of the node
Question 4: What does the following piece of code do?
public void func(Tree root) { func(root.left()); func(root.right()); System.out.println(root.data()); }
Preorder traversal
Inorder traversal
Postorder traversal
Level order traversal
Question 5: What does the following piece of code do?
public void func(Tree root) { System.out.println(root.data()); func(root.left()); func(root.right()); }
Preorder traversal
Inorder traversal
Postorder traversal
Level order traversal
Question 6: How will you find the minimum element in a binary search tree?
public void min(Tree root) { while(root.left() != null) { root = root.left(); } System.out.println(root.data()); } public void min(Tree root) { while(root != null) { root = root.left(); } System.out.println(root.data()); } public void min(Tree root) { while(root.right() != null) { root = root.right(); } System.out.println(root.data()); } public void min(Tree root) { while(root != null) { root = root.right(); } System.out.println(root.data()); }
Question 7: How will you find the maximum element in a binary search tree?
public void max(Tree root) { while(root.left() != null) { root = root.left(); } System.out.println(root.data()); } public void max(Tree root) { while(root != null) { root = root.left(); } System.out.println(root.data()); } public void max(Tree root) { while(root.right() != null) { root = root.right(); } System.out.println(root.data()); } public void max(Tree root) { while(root != null) { root = root.right(); } System.out.println(root.data()); }
Question 8: What are the worst case and average case complexities of a binary search tree?
O(n), O(n)
O(logn), O(logn)
O(logn), O(n)
O(n), O(logn)
Question 9: Given that 2 elements are present in the tree, write a function to find the LCA(Least Common Ancestor) of the 2 elements.
public void lca(Tree root,int n1, int n2) { while (root != NULL) { if (root.data() > n1 && root.data() > n2) root = root.right(); else if (root.data() < n1 && root.data() < n2) root = root.left(); else break; } System.out.println(root.data()); } public void lca(Tree root,int n1, int n2) { while (root != NULL) { if (root.data() > n1 && root.data() < n2) root = root.left(); else if (root.data() < n1 && root.data() > n2) root = root.right(); else break; } System.out.println(root.data()); } public void lca(Tree root,int n1, int n2) { while (root != NULL) { if (root.data() > n1 && root.data() > n2) root = root.left(); else if (root.data() < n1 && root.data() < n2) root = root.right(); else break; } System.out.println(root.data()); } public void lca(Tree root,int n1, int n2) { while (root != NULL) { if (root.data() > n1 && root.data() > n2) root = root.left.left(); else if (root.data() < n1 && root.data() < n2) root = root.right.right(); else break; } System.out.println(root.data()); }
Question 10: What are the conditions for an optimal binary search tree and what is its advantage?
The tree should not be modified and you should know how often the keys are accessed, it improves the lookup cost
You should know the frequency of access of the keys, improves the lookup time
The tree can be modified and you should know the number of elements in the tree before hand, it improves the deletion time
The tree should be just modified and improves the lookup time
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
