Explain What is a node data structure Write a function such that the node data structure to visit all of the nodes in a binary tree?
Latest Answer: a pointer with no return type is called a null pointer.It may be any kind of datatype.It takes the data type according to the requirement in the program.for eg: #include using namespace std;void increase (void* data, int psize){ ...
Is it possible to implement trees using arrays ? If yes, how?
Latest Answer: Yes, it is possible. Here is an example of implementing a binary tree:Consider an attay : a[n];Place the root in first position. and let the current position to be i = 0;place left node at the position: 2i+1place right node at the position: 2i+2. Repeat ...
Explain how recursive algorithm is converted into recurrence relation with example.
Explain how performance of algorithm is analysed?
Latest Answer: The performance of an algorithm is analysed by the time complexity as well as its space complexity though both the complexities are trafe-offs between them. If time complexity increases then space complexity decreases & vice-versa. Also the best & ...
What is Polymorphic Data Type? Give example
What does it mean when a data structure is declared volatile?
What does it mean when a data structure is declared Const?
Latest Answer: Volatile - you are asking compiler to not to optimise the data structure as well as to reload to CPU registers whenever it is in use. Not a good idea for Data structure, will waste lot of CPU time in loading long data structures. ...
Given a string of characters (let us say there are about 100 characters or more in the string), what is the most efficient method to use for finding out the character that repeats itself the most?Is it
Latest Answer: There is an way to solve this issue with complexity of O(n).1. MAke an array size of 2562. Using each charater read from the string as an index incremented the counter of corresponding character.3. Let that counter be max, so inshort you have variables holding a char with number of times repeated in the string. ...
View page [1] 2 3 4 5 6 7 8 9 10 Next >>
Go Top
