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?

ravi6771

 Profile Answers by ravi6771 Questions by ravi6771

• Aug 12th, 2009

Struct node{int datastruct node *next;}*root;int count=0;void count(struct node *nd){if(nd!=NULL){count(nd->left);count++;count(nd->right);}}call count(root) which give the count in count variable.

Answer Question  Select Best Answer

How is memory reserved using a declaration statement?

clickankit4u

 Profile Answers by clickankit4u Questions by clickankit4u

• May 31st, 2009

When you delare any variable it is assigned in the data segment.Data Segment (data+bss+heap)stackand this is so memory is reserved.

Answer Question  Select Best Answer

What is forest data structure? How is it useful?

snyder

 Profile Answers by snyder Questions by snyder

• Mar 13th, 2012

A forest is an undirected graph which is composed of connected components in which each and every component can be represented as a tree. . . however i don't know its use exclusively . . .

Answer Question  Select Best Answer

Write a program of Linked List using pointers.

sid0812

 Profile Answers by sid0812 Questions by sid0812

• Nov 11th, 2010

import java.io.*;class node {  public int info;  node next; }class link {  node head;  public void initialize()   {    n...

Answer Question  Select Best Answer

Which data structure allows deleting data elements from front and inserting at rear?a. Stacksb. Queuesc. Dequesd. Binary search tree

gangabyndoor

 Profile Answers by gangabyndoor Questions by gangabyndoor

• Mar 21st, 2010

It is Queues only. In Queues Insertion take place from rear end and deletion take place from front end.

Answer Question  Select Best Answer

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• Apr 27th, 2012

There are primitive data types but not primitive data structures.
Primitive data types are predefined types of data, which are supported by the programming language. For example, integer, character, and string are all primitive data types.

Answer Question  Select Best Answer

While creating a heterogenous linklist we know that we use void pointer. But when we need to read the information, How will you do it? How will you figure out to what datatype does the data belong to?

Sereche

 Profile Answers by Sereche Questions by Sereche

• Jul 9th, 2012

Some kind of information regarding the type is obviously required. If there is no way of determining it from the context (i.e., the previous node in the list somehow specifies the type), it must be st...

Answer Question  Select Best Answer

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• Apr 17th, 2012

1.TPump allows us to load data into tables with referential integrity which MultiLoad doesn't allow. 2.TPpump does not support MULTI-SET tables,but multiple tables can be loaded in the same MultiLoad...

Answer Question  Select Best Answer

How to retrieve the value of hidden filed in one page from another

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• Apr 11th, 2012

In .aspx, you can access the hidden fields when the page is submitted by using -
string customerId = Request.Form["txtCustomerId"];

Answer Question  Select Best Answer

Among arrays and linked list, which one is easiest to imlement and why?

mohd tauhid

• Sep 10th, 2011

1. in the array memory is allocated at the compile time so advance knowledge of size of the array is needed. the second thing about array is it need continues memory block and third thing is it is a e...

Answer Question  Select Best Answer

can you please explain the oops concepts with example program? like in which place data abstraction is used?

snyder

 Profile Answers by snyder Questions by snyder

• Mar 7th, 2012

Abstraction is a concept in which the complexity of the system is hidden from the user and the user interacts with the system via interfaces. the simplest example of this concept is ur computer or l...

Answer Question  Select Best Answer

Define data type NodeCD, declare 100 variables of CD1 & access data?

shraisy

 Profile Answers by shraisy Questions by shraisy

• Sep 20th, 2011

Code
span style="font-style: italic;">//defining node// declaring 100 variables of type structure// to access
{
scanf("%d""%d
, arr[i]);
}

please correct me if wrong !

Answer Question  Select Best Answer

Relationship between transfer function and homogeneous solution

kirankumartana

• Jul 1st, 2013

It is the ratio of laplace transform(input to out put) of any system with out changing time domain

Answer Question  Select Best Answer

Raaakesh

 Profile Answers by Raaakesh Questions by Raaakesh

• Sep 26th, 2011

Yes, but a try{..} block cant end with more than one finally {..} block.

Answer Question  Select Best Answer

What is the difference between code switching and code mixing?

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• Apr 27th, 2012

Concurrent use of more than one language in the same sentence of a conversation is known as code switching as

Code mixing refers to mixing of two or more languages in a speech.It occur within a multilingual setting where speakers share more than one language.

Answer Question  Select Best Answer

Why macro cannot be used in place of inline function?

Sastry

• Feb 22nd, 2012

Inline functions doesnt pass the control to the function, its actually replaced at the place where it is called. Like #define, But when Macro is called it passes the control to the macro block. which actually takes some CPU cycles.

Answer Question  Select Best Answer

saifan

• Oct 25th, 2011

Is it as simple as,

function int CalculateCube(input argNumber)
{
return argNumber*argNumber*argNumber;
}

Answer Question  Select Best Answer

Design an iterative algorithm to traverse a binary tree represented in two dimensional matrix

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• Jul 16th, 2012

A binary tree can be traversed using only one dimensional array. InOrder_TreeTraversal() { prev = null; current = root; next = null; while( current != null ) { if(prev == current.parent) { prev = cu...

Answer Question  Select Best Answer

snyder

 Profile Answers by snyder Questions by snyder

• Feb 27th, 2012

Advantage The basic and the only (in my opinion) advantage is that various algorithms such as searching algorithms are optimized using non linear data structure. When time complexity is compared, the...

Answer Question  Select Best Answer

How to implement reverse linked List using recursion?

Sandhya.Kishan

 Profile Answers by Sandhya.Kishan Questions by Sandhya.Kishan

• Apr 11th, 2012

The program is

List* recur_rlist(List* head)
{
List* result;
if(!(head && head->next))
return head;
result = recur_rlist(head->next);
head->next->next = head;
head->next = NULL;
return result;
}
void printList(List* head)
{
while(head != NULL) {
std::cout

Answer Question  Select Best Answer