0
Want this question answered?
Be notified when an answer is posted
Add your answer:
Earn +20 pts
What is the term given to to the point where two opposite electrical currents meet?
node Any number of currents can meet at a node, not just two.
Find the level of a node in binary tree?
level of a node in any binary tree can be calculated by summing up the number of nodes traversed from the root node of the tree to the node whose level has to be calculated!!!! dats it!! if count is the no. of elements passed, then floor(log2(count-1)) is the level
How to write a program to implement a binary search tree in C?
struct node{ int data; struct node *left, *right; }; typedef struct node node; non recursive method : main() { node * root = NULL , *new = NULL *temp1 =NULL , * temp2 = NULL; int num =1; printf(" Enter the elements of the tree( enter 0 to exit)\n"); while(1) { scanf("%d", &num); if(num==0) break; new = malloc(sizeof(node)); new->left = new->right = NULL; new->data = num; if( root NULL) root->left = new; else insert( new,root->left); } }
Write an iterative function to search an element in a binary search tree?
_node* search (_node* head, _key key) { _node* node; for (node=head; node != NULL;;) { if (key == node->key) return node; else if (key < node.>key) node = node->left; else node = node->right; } return node; }
Algoritm for deleting the last element from a list?
Given a list and a node to delete, use the following algorithm: // Are we deleting the head node? if (node == list.head) { // Yes -- assign its next node as the new head list.head = node.next } else // The node is not the head node { // Point to the head node prev = list.head // Traverse the list to locate the node that comes immediately before the one we want to delete while (prev.next != node) { prev = prev.next; } end while // Assign the node's next node to the previous node's next node prev.next = node.next; } end if // Before deleting the node, reset its next node node.next = null; // Now delete the node. delete node;
What The number of different trees with 8 node?
248
Difference between in-degree and out-degree of a vertex in data structures?
In-degree is a count of the number of ties directed to the node, and out-degree is the number of ties that the node directs to others.
If the degree of a node is 0 then the tree is called?
This would be just a single node, since no edges (you can think of degree as the number of edges connected to a node). If you are talking about the in-degree, or out-degree of a node being zero, this can happen many times in a directed graph (in-degree = # edges going IN to node, out-degree = # edges going out...).
What is the term given to to the point where two opposite electrical currents meet?
node Any number of currents can meet at a node, not just two.
How can I enrol on a do not call register?
Register your number on the national do not call list, it is free to register. It takes about 30 days after you register, for the telephone calls to stop.
Find the level of a node in binary tree?
level of a node in any binary tree can be calculated by summing up the number of nodes traversed from the root node of the tree to the node whose level has to be calculated!!!! dats it!! if count is the no. of elements passed, then floor(log2(count-1)) is the level
How to write a program to implement a binary search tree in C?
struct node{ int data; struct node *left, *right; }; typedef struct node node; non recursive method : main() { node * root = NULL , *new = NULL *temp1 =NULL , * temp2 = NULL; int num =1; printf(" Enter the elements of the tree( enter 0 to exit)\n"); while(1) { scanf("%d", &num); if(num==0) break; new = malloc(sizeof(node)); new->left = new->right = NULL; new->data = num; if( root NULL) root->left = new; else insert( new,root->left); } }
What is the cash value of a vintage cash register made from national cash register company in Dayton Ohio model number S729848746G?
What year cash register is model number S729848746G
Write an iterative function to search an element in a binary search tree?
_node* search (_node* head, _key key) { _node* node; for (node=head; node != NULL;;) { if (key == node->key) return node; else if (key < node.>key) node = node->left; else node = node->right; } return node; }
Where can one sign up for courses in IT?
It depends on the type of school that is being looked at. Most campuses that offer IT courses have administrative offices that you can go into to register. Online schools offer flexible classes and you can register online for them.
What is nball register number?
24400573.
What are the limiting factors for growing mesh networks?
Since a mesh, ideally, connects *every* node to *every other* node, the number of connections grows massively as the mesh expands. The limiting factor is the number of interconnections that are practical.
