Recursion and Linked Lists
Hi guys. Quick question for anyone who can help.
I have a Binomial tree, three layers deep.
(hopefully formatting works right on this!)
------4
----2---5
--1---3---6
These are my nodes.
Somehow I need to make node '5' and node '2' BOTH connect to node '3' using linked lists and pointers.
Can anyone either tell me or point me in the right direction of what I need to do/research?
I have a Binomial tree, three layers deep.
(hopefully formatting works right on this!)
------4
----2---5
--1---3---6
These are my nodes.
Somehow I need to make node '5' and node '2' BOTH connect to node '3' using linked lists and pointers.
Can anyone either tell me or point me in the right direction of what I need to do/research?
Last edited on
I'm not sure I understand the problem.
four->right->left = three;
four->left->right = three;
Did you omit any parameters of the problem?
four->right->left = three;
four->left->right = three;
Did you omit any parameters of the problem?
Topic archived. No new replies allowed.