thanks!
On 3/7/07, Jair Cazarin <[EMAIL PROTECTED]> wrote:
>
> That's a conditional expression. Check google.
>
> On 3/6/07, Lukas alkauskas <[EMAIL PROTECTED]> wrote:
>
> > BTW where i can find this kind "(lheight > rheight ? lheight : rheight)"
> > syntax tutorial or smth ?
> >
> > On 3/6/07, N
That's a conditional expression. Check google.
On 3/6/07, Lukas alkauskas <[EMAIL PROTECTED]> wrote:
>
> BTW where i can find this kind "(lheight > rheight ? lheight : rheight)"
> syntax tutorial or smth ?
>
> On 3/6/07, Nat (Padmanabhan Natarajan) < [EMAIL PROTECTED]> wrote:
> >
> > The system u
BTW where i can find this kind "(lheight > rheight ? lheight : rheight)"
syntax tutorial or smth ?
On 3/6/07, Nat (Padmanabhan Natarajan) <[EMAIL PROTECTED]> wrote:
>
> The system uses only one stack to implement recursion, so you should be
> able to do it too :-)
>
> On 3/6/07, NUPUL < [EMAIL PRO
The system uses only one stack to implement recursion, so you should be able
to do it too :-)
On 3/6/07, NUPUL <[EMAIL PROTECTED]> wrote:
>
>
>
>
> On Feb 28, 8:06 pm, "k3xji" <[EMAIL PROTECTED]> wrote:
>
> > Is there any way of calculating the depth of a binary tree without
> > using *recursive w
On Feb 28, 8:06 pm, "k3xji" <[EMAIL PROTECTED]> wrote:
> Is there any way of calculating the depth of a binary tree without
> using *recursive way*.Also not using *log2-1* method.I am asking this
> because Is there any way of doing this kind of operation with just
> using stacks or quenes.
Yes
Thats correct.On 10/27/06, arun kumar manickan <[EMAIL PROTECTED]> wrote:
DFS on a BST = it pre order traversal ..
is this correct ?
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To pos
DFS on a BST = it pre order traversal ..
is this correct ?
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe fro
draw a trivial tree.
Traverse it 'in-order'. Do a DFS.
See if you get the same result.
Don't underestimate the power of paper and thought.
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To
NO
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more op
