Recently is not in the data structure, the tree before all learn well, learn tree, found the tree insert, delete, and change the value associated with the secondary pointer as a function parameter, this I can understand, but I suddenly thought of, what I am writing the chain bracelet stack, regardless of the insert to delete, is useless to the secondary pointer?? Then at some online code, and found that I was wrong, really is to use the secondary pointer to change specification values, however, is what before I useless secondary pointer (as a function parameter) is also OK? Then look at the others related to summarize, with the head pointer list without secondary pointer can also carry out chain operation (but he didn't explain why can need not,,,), so I want to ask,

CodePudding user response:

Has a head nodes that took their head to find the node you want, what will this secondary pointer, as for the list of what the secondary pointer with no love, truth, anyway the basic effect about

CodePudding user response:

1/f, reference and 蘤 old crepe response:

has a head nodes that took their head to find the node you want, what will this secondary pointer, as for the list of what use, secondary pointer love truth anyway, basic effect about

Head nodes don't also want to make it next to the next node, it is not change the value

CodePudding user response:

?? Whose values change?? You want to use the secondary pointer to change the value of the next?? This is going to be ok
Are you dizzy

CodePudding user response:

refer to the second floor qq_45218336 response:

Quote: 1/f, reference and 蘤 old crepe reply:

has a head nodes that took their head to find the node you want, what will this secondary pointer, as for the list of what the secondary pointer with no love, anyway the truth, the basic effect almost

Head nodes don't also want to make it next to the next node, it is not change the value of

Modify its next there is no need for the secondary pointer

CodePudding user response:

1/f, reference and 蘤 old crepe response:

has a head nodes that took their head to find the node you want, what will this secondary pointer, as for the list of what use, secondary pointer love truth anyway, basic effect about

I am dizzy???? , the tree insertion function is what must be used as secondary pointer parameter (function has no return value), trees do not list too

CodePudding user response:

reference 5 floor qq_45218336 reply:

Quote: 1/f, reference and 蘤 old crepe reply:

has a head nodes that took their head to find the node you want, what will this secondary pointer, as for the list of what use, secondary pointer love truth anyway, basic effect about

I am dizzy? , the tree insertion function is what must be used as secondary pointer parameter (function has no return value), the tree is not a linked list, too

The chain store,,,,,,,,

CodePudding user response:

refer to 6th floor qq_45218336 response:

Quote: refer to the 5 floor qq_45218336 response:

Quote: 1/f, reference and 蘤 old crepe reply:

has a head nodes that took their head to find the node you want, what will this secondary pointer, as for the list of what the secondary pointer with no love, anyway the truth, the basic effect almost

I am dizzy? , the tree insertion function is what must be used as secondary pointer parameter (function has no return value), the tree is not a linked list, too

The chain store,,,,,,,,

Has a regulation, to be honest I see the basic is the head node, just work, why struggle so much, special circumstances special consideration, not casually, how to show how to write operation to also go

CodePudding user response:

https://blog.csdn.net/qq_36626914/article/details/82493906
Thank the bosses tell me through!

CodePudding user response:

I hope it can help you: https://blog.csdn.net/it_xiangqiang/category_10581430.html
I hope it can help you: https://blog.csdn.net/it_xiangqiang/category_10768339.html