how to make basic Tree data structure

I need an explanation how node.child node.parent can be implemented as moving to next item in tree?

I want a code that defined in class structure for tree data structure

it will be like this in python

class Node():

def __init__(self, parent=None, position=None, child):

self.parent = parent

self.position = position

self.child = child

parent and child holds another node structure

Answer 1

[Sulaymon Eshkabilov]

If understood correctly your question, the structure variable can be built in the following way, e.g.:

Child1 = magic(3);
Child2 = randi(3,2,3);
Child3 = 'Today';
Home = 'City Street zip #';
Parent1.Child1 = Child1;
Parent1.Child2 = Child2;
Parent2.Child3 = Child3;
Family.Parent1 = Parent1;
Family.Parent2 = Parent2;
Family.Home = Home

Family = struct with fields:
    Parent1: [1×1 struct]
    Parent2: [1×1 struct]
       Home: 'City Street zip #'

disp(Parent1)

    Child1: [3×3 double]
    Child2: [2×3 double]

disp(Parent2)

    Child3: 'Today'

[Melih Furkan SEN]

Not really. I want to step to next child in tree in a loop