gs gs121 Binary Trees - Binary Trees using Linked Lists - 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: Advantages of linked list representation of binary trees over arrays?
dynamic size
ease of insertion/deletion
ease in randomly accessing a node
both dynamic size and ease in insertion/deletion
Question 2: Disadvantages of linked list representation of binary trees over arrays?
Randomly accessing is not possible
Extra memory for a pointer is needed with every element in the list
Difficulty in deletion
Random access is not possible and extra memory with every element
Question 3: Which of the following traversing algorithm is not used to traverse in a tree?
Post order
Pre order
Post order
Randomized
Question 4: Level order traversal of a tree is formed with the help of
breadth first search
depth first search
dijkstra’s algorithm
prims algorithm
Question 5: Identify the reason which doesn’t play a key role to use threaded binary trees?
The storage required by stack and queue is more
The pointers in most of nodes of a binary tree are NULL
It is Difficult to find a successor node
They occupy less size
Question 6: The following lines talks about deleting a node in a binary tree.(the tree property must not be violated after deletion)
i) from root search for the node to be deleted
ii)
iii) delete the node at
what must be statement ii) and fill up statement iii)
i) from root search for the node to be deleted
ii)
iii) delete the node at
what must be statement ii) and fill up statement iii)
ii)-find random node,replace with node to be deleted. iii)- delete the node
ii)-find node to be deleted. iii)- delete the node at found location
ii)-find deepest node,replace with node to be deleted. iii)- delete a node
ii)-find deepest node,replace with node to be deleted. iii)- delete the deepest node
Question 7: What may be the psuedo code for finding the size of a tree?
find_size(root_node–>left_node) + 1 + find_size(root_node–>right_node)
find_size(root_node–>left_node) + find_size(root_node–>right_node)
find_size(root_node–>right_node) – 1
find_size(root_node–>left_node + 1
Question 8: What is missing in this logic of finding a path in the tree for a given sum (i.e checking whether there will be a path from roots to leaf nodes with given sum)?
checkSum(struct bin-treenode *root , int sum) : if(root==null) return sum as 0 else : leftover_sum=sum-root_node-->value //missing
code for having recursive calls to either only left tree or right trees or to both subtrees depending on their existence
code for having recursive calls to either only left tree or right trees
code for having recursive calls to either only left tree
code for having recursive calls to either only right trees
Question 9: What must be the missing logic below so as to print mirror of a tree as below as an example?
swapping of left and right nodes is missing
swapping of left with root nodes is missing
swapping of right with root nodes is missing
nothing is missing
Question 10: What is the code below trying to print?
void print(tree *root,tree *node) { if(root ==null) return 0 if(root-->left==node || root-->right==node) || print(root->left,node) ||printf(root->right,node) { print(root->data) } }
just printing all nodes
not a valid logic to do any task
printing ancestors of a node passed as argument
printing nodes from leaf node to a node passed as argument
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
