Authors:
Stuart Reges, Marty Stepp
Chapter:
Binary Trees
Exercise:
Exercises
Question:19 | ISBN:9780136091813 | Edition: 2
Question
Write a method called inOrderList that returns a list containing the sequence of values obtained from an inorder traversal of your binary tree of integers. For example, if a variable t refers to reference tree #3, then the call t.inOrderList() should return the list [8, 3, 7, 2, 1] . If the tree is empty, your method should return an empty list.
Add the above method to the IntTree class from this chapter. You may define additional private methods to implement your public method if necessary. Several problem descriptions refer to the following reference binary trees:
Answer
Implementation of inOrderList method:
public List inOrderList()
{
return inOrderList(overallRoot,
new ArrayList());
}
private List inOrderList(IntTreeNode root,
List list)
{
if(root != null)
{
inOrderList(root.left, list);
list.add(root.data);
inOrderList(root.right, list);
}
return list;
}