| Author |
Calculate a tree
|
Terence hiu
Ranch Hand
Joined: Oct 21, 2012
Posts: 36
|
|
Say i have a tree structure created in java
root= +
root left node = +
rood right node = 4
root left of left =2
root left of right =3
(2+3)+4
how would i calculate this tree?
|
 |
Henry Wong
author
Sheriff
Joined: Sep 28, 2004
Posts: 16681
|
|
Terence hiu wrote:Say i have a tree structure created in java
root= +
root left node = +
rood right node = 4
root left of left =2
root left of right =3
(2+3)+4
how would i calculate this tree?
If I were to do it, I would choose to do it recursively. Encountering a number would be the base condition, where the number is simply returned. Encountering an operator will trigger two recursive calls to get the operands which will be needed to calculate the value to be returned.
Henry
|
Books: Java Threads, 3rd Edition, Jini in a Nutshell, and Java Gems (contributor)
|
 |
Terence hiu
Ranch Hand
Joined: Oct 21, 2012
Posts: 36
|
|
Henry Wong wrote:
Terence hiu wrote:Say i have a tree structure created in java
root= +
root left node = +
rood right node = 4
root left of left =2
root left of right =3
(2+3)+4
how would i calculate this tree?
If I were to do it, I would choose to do it recursively. Encountering a number would be the base condition, where the number is simply returned. Encountering an operator will trigger two recursive calls to get the operands which will be needed to calculate the value to be returned.
Henry
Thankyou, problem solved
|
 |
 |
|
|
subject: Calculate a tree
|
|
|