05-07-2014
If access to the header of the list is gone, you're out of control of those data.
10 More Discussions You Might Find Interesting
1. Programming
Can any one help me in reversing the single linked list and at the same time i want to print the reversed links. (2 Replies)
Discussion started by: dhanamurthy
2 Replies
2. UNIX for Dummies Questions & Answers
A perl script that displays the list of files which have multiple links..!
ls -l shows number of links in a field. (0 Replies)
Discussion started by: aadi_uni
0 Replies
3. Programming
Suppose to have:
struct Tstudent
{
string name, surname;
int matriculation_num;
};
struct Tnode
{
Tstudent* student;
Tnodo* next;
} L;I want to deference that "student" pointer. For example, I tried with:
*(L->student).matriculation_numbut it not worked, as terminal... (4 Replies)
Discussion started by: Luke Bonham
4 Replies
4. Programming
Given an in-between(any node not at the start and end of the linked list) node within a singly linear linked list, how to delete that node, when head pointer of list is not given? (13 Replies)
Discussion started by: rupeshkp728
13 Replies
5. Programming
I need C++ Code for single linked list
With operations as
1)insert at any position
2)delete any
3)change the data of any position (2 Replies)
Discussion started by: girija
2 Replies
6. Programming
i have this code
typedef struct client_list {
char *client_name;
struct client_list * next;
int client_socket_fd;
} client;
client *current, *head; head = NULL;
char *h="test";
add_client(current, h, head, &client_socket_fd);
... (24 Replies)
Discussion started by: omega666
24 Replies
7. Programming
i have a linked list set up like
typedef struct client_list {
char *client_name;
int client_socket_fd;
struct client_list *next;
} client;
client *client_list=NULL;
before adding to the list i check if it already exists, only if it does not then i add
if (client_list==NULL... (1 Reply)
Discussion started by: omega666
1 Replies
8. Programming
If i have a linked list in C, how do I edit a node in it? Without ruining the whole list, by this i mean end up making it null or circular... (since it has to be linear and has to stop somewhere):wall:
Can some one provide an example, making it have like 5 nodes, and then edit a string of the... (3 Replies)
Discussion started by: omega666
3 Replies
9. Programming
#include<stdio.h>
#include<stdlib.h>
struct LinkedList
{
int val;
struct LinkedList *next;
}node; /*Creating a structure variable*/
typedef struct LinkedList Node;
Node *start = NULL;
int create(int i)
{
Node *temp = NULL;
if (start == NULL)
... (5 Replies)
Discussion started by: prinsh
5 Replies
10. Programming
Program to reverse a linked list by traversing only once. (1 Reply)
Discussion started by: VSSajjan
1 Replies
LEARN ABOUT ULTRIX
remnode
remnode(8) System Manager's Manual remnode(8)
Name
remnode - remove one or more entries from the nodes database
Syntax
/etc/remnode [ node ]
Description
For each given node argument, deletes the corresponding node entry (or entries) from the nodes database. The nodes database is the one used
by DECnet. The node is either the node address or the node name for each node entry that you want to delete. Note, you can specify more
than one node argument in a single command.
A node address is a decimal integer in the range of 1 to 1023 for single area networks, or has the format a.n for multiarea networks, where
a is the network area number (a decimal integer in the range of 2 to 63) and n is the node number (a decimal integer in the range of 1 to
1023).
A node name can be from one to six alphanumeric characters, including at least one letter.
Examples
This command removes the entries for nodes 44.70 and Mynode from the nodes database:
# /etc/remnode 44.70 mynode <RET>
This command removes the entry for node lttwi from the nodes database:
# /etc/remnode lttwi <RET>
See Also
addnode(8), ccr(8), getnode(8), load(8), mop_mom(8), trigger(8)
remnode(8)