programming forums Java Mobile Certification Databases Caching Books Engineering Micro Controllers OS Languages Paradigms IDEs Build Tools Frameworks Application Servers Open Source This Site Careers Other all forums
this forum made possible by our volunteer staff, including ...
Marshals:
• Campbell Ritchie
• Liutauras Vilda
• Jeanne Boyarsky
• Devaka Cooray
• Paul Clapham
Sheriffs:
• Tim Cooke
• Knute Snortum
• Bear Bibeault
Saloon Keepers:
• Ron McLeod
• Tim Moores
• Stephan van Hulst
• Piet Souris
• Ganesh Patekar
Bartenders:
• Frits Walraven
• Carey Brown
• Tim Holloway

# Calculate a tree

Ranch Hand
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?

author
Posts: 23834
140

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

Terence hiu
Ranch Hand
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

 It is sorta covered in the JavaRanch Style Guide.