Answer Posted / tomás senart
There is a difference between a binary tree and a binary search tree.
A binary tree isn't organized in any sense. The values of it's nodes can be random and have no relationship to each other.
Here is a method for finding the biggest node on a binary tree.
typedef struct node {
int value;
struct tree *right;
struct tree *left;
} Node;
int biggest_node(Node *node)
{
int biggest_left, biggest_right;
biggest_left = node->left ? biggest_node(node->left) : node->value;
biggest_right = node->right ? biggest_node(node->right) : node->value;
if(node->value < biggest_left && node->value < biggest_right)
return biggest_left > biggest_right ? biggest_left : biggest_right;
else if(node->value < biggest_right)
return biggest_right;
else if(node->value < biggest_left)
return biggest_left;
else
return node->value;
}
| Is This Answer Correct ? | 7 Yes | 6 No |
Post New Answer View All Answers
could you please send the program code for multiplying sparse matrix in c????
write a program for area of circumference of shapes
What is the match merge ? compare data step match merge with proc sql merge - how many types are there ? data step vs proc sql
how to test pierrot divisor
Set up procedure for generating a wire frame display of a polyhedron with the hidden edges of the object drawn with dashed lines
#include
how to programme using switch statements and fuctions, a programme that will output two even numbers, two odd numbers and two prime numbers of the users chioce.
Sir... please give some important coding questions asked by product companies..
What is the difference between proc means and proc tabulate ? explain with a simple example when you have to use means or tabulate?
Write a Program in 'C' To Insert a Unique Number Only. (Hint: Just Like a Primary Key Numbers In Database.) Please Some One Suggest Me a Better Solution for This question ??
create a C-code that will display the total fare of a passenger of a taxi if the driver press enter,the timer will stop. Every 10 counts is 2 pesos. Initial value is 25.00
write a c program to input initial & final time in the format hh:mm and find the time intervel between them? Ex inputs are initial 06:30 final 00:05 and 23:22 final 22.30
why nlogn is the lower limit of any sort algorithm?
Write a routine to implement the polymarker function
How can you relate the function with the structure? Explain with an appropriate example.