[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: creating a binary trees
From: |
Sergei Steshenko |
Subject: |
Re: creating a binary trees |
Date: |
Sat, 19 Nov 2011 10:46:39 -0800 (PST) |
----- Original Message -----
> From: Jordi Gutiérrez Hermoso <address@hidden>
> To: Faizal <address@hidden>
> Cc: address@hidden
> Sent: Saturday, November 19, 2011 8:15 PM
> Subject: Re: creating a binary trees
>
> On 18 November 2011 20:22, Faizal <address@hidden> wrote:
>> Is there any octave program sample that I can use to start up in creating a
>> binary trees for data structure. Thank you.
>
> Octave's data structures are somewhat intentionally quite limited.
> What sort of task do you need a binary tree for?
>
> - Jordi G. H.
> _______________________________________________
For example, cell array can be array of arrays - as many levels as desired,
though in an old Email of mine I showed that list indexes gets truncated.
So cell array can be used to represent a binary tree. Or a struct - something
like
tree.left.left.right.left.right = whatever;
.
So, what's the problem ?
Regards,
Sergei.