Answer Posted / crispin

/*
* Simple tree node representation
*/
struct node_t {
struct node_t *left;
struct note_t *right;
};

/*
* Return the maximum depth of the tree given a pointer
* to its root node.
*/
unsigned int
tree_depth (node_t *root)
{
return (NULL == root) ? 0 :
MAX(tree_depth(root->left, root->right)+1);
}

If null and 0 are equivalent as null pointer constants, which should I use?

1305

---

‘ C’ PROGRAME TO SHOW THE TYPE OF TRANGLE BY ACCEPTING IT’S LENGTH .

2926

---

What is array within structure?

1168

---

Difference between malloc() and calloc() function?

1264

---

a single linked list consists of nodes a to z .print the nodes in reverse order from z to a using recursion

2838

---

What is the deal on sprintf_s return value?

1184

---

Write a progarm to find the length of string using switch case?

2119

---

State two uses of pointers in C?

1106

---

What is storage class?

1120

---

.main() { char *p = "hello world!"; p[0] = 'H'; printf("%s",p); }

1367

---

Program to find the sum of digits of a given number until the sum becomes a single digit. (e.g. 12345=>1+2+3+4+5=15=>1+5=6)

1206

---

What are data types in c language?

1101

---

the number of measuring units from a arbitrary starting point in a record area or control block to some other point a) branching b) recording pointer c) none d) offset

1156

---

What is static function in c?

1162

---

Explain what is meant by high-order and low-order bytes?

1088

---