Data Structure Binary Trees Linked Lists Online Exam Quiz
Data Structure Binary Trees Linked Lists GK Quiz. Question and Answers related to Data Structure Binary Trees Linked Lists. MCQ (Multiple Choice Questions with answers about Data Structure Binary Trees Linked Lists
Level order traversal of a tree is formed with the help of
Options
A : breadth first search
B : depth first search
C : dijkstra’s algorithm
D : prims algorithm
Advantages of linked list representation of binary trees over arrays?
Options
A : dynamic size
B : ease of insertion/deletion
C : ease in randomly accessing a node
D : both dynamic size and ease in insertion/deletion
What may be the psuedo code for finding the size of a tree?
Options
A : find_size(root_node–>left_node) + 1 + find_size(root_node–>right_node)
B : find_size(root_node–>left_node) + find_size(root_node–>right_node)
C : find_size(root_node–>right_node) – 1
D : find_size(root_node–>left_node + 1
Which of the following traversing algorithm is not used to traverse in a tree?
Options
A : Post order
B : Pre order
C : Post order
D : Randomized
Disadvantages of linked list representation of binary trees over arrays?
Options
A : Randomly accessing is not possible
B : Extra memory for a pointer is needed with every element in the list
C : Difficulty in deletion
D : Random access is not possible and extra memory with every element
Identify the reason which doesn’t play a key role to use threaded binary trees?
Options
A : The storage required by stack and queue is more
B : The pointers in most of nodes of a binary tree are NULL
C : It is Difficult to find a successor node
D : They occupy less size
Data Structure Adjacency List more Online Exam Quiz
Data Structure Binary Search Iterative
Data Structure Binary Search Tree
Data Structure Binary Tree Properties
Data Structure Binary Trees Array
Data Structure Binomial Fibonacci Heap