June 24, 2019
The first and the last node in the doubly linked list will point to Null
Please login to submit your explanation
You can check your performance of this question after Login/Signup
to find the total no of nodes in nth level by 2^n-1 1 level 1 nodes, 2 level 3 nodes, 3 level 7 nodes, 4 level 15 nodes, 5 level 31 thus 7 has 127 nodes
None of these
Explanation: A linear collection of data elements where the linear node is given by means of pointer is called linked list.
no cycle of odd length
a cycle of odd length
It is obvious that if a graph has an odd length cycle then it cannot be Bipartite. In Bipartite graph there are two sets of vertices such that no vertex in a set is connected with any other vertex of the same set).
A Bipartite Graph is a graph whose vertices can be divided into two independent sets, U and V such that every edge (u, v) either connects a vertex from U to V or a vertex from V to U. In other words, for every edge (u, v), either u belongs to U and v to V, or u belongs to V and v to U. We can also say that there is no edge that connects vertices of the same set.
Allocation that takes place at compile time
Allocation that take place as bipartite graph
memory allocation that takes place during run time rendering the resizing of an Array
All of these
Memory allocation that takes place during run time rendering the resizing of an Array is called Dynamic Allocation in Array
The formulae is n*(n-1)/2
The maximum no. of nodes possible in the tree is 2h+1 -1
The height of a BST is given as h
Inorder gives in correct order
the run time for traversing all the nodes of a binary search tree with n nodes and printing them in an order is O(n)
Please login to report
Login/Signup to comment