Its better to wait for a productive programmer to become available than it is to wait for the first available programmer to become productive. Steve McConnell

Print all BST sum

Language Java | Level Intermediate | Category Data structure | September 8, 2015 8:06 am

Data structure Description

Write a program to print the sum of all nodes in the binary search tree using in-order, pre-order and post order iteration.



All Binary Tree Values: 1  2  3  4  
Print the Tree values using in order: 1, 2, 3, 4 
Print the Tree values using Preorder: 2, 1, 3, 4
Print the Tree values using Post order: 1, 4, 3, 2



No comments available!

Please login to add comments.