Lab5

1) Tree traversal techniques

2) Binary tree implementation in java.

    - study LinkedBinaryTree.java implementation of the interface BinaryTree.java which extends the interface Tree.java.

    - download BinaryTree1.zip and extract it to some directory.

    - compile and run tryBinaryTree1.java resulted from extracting BinaryTree1.zip

>java tryBinaryTree1
node type left children right children comment
node3 Internal node5
node5 External
node1 Internal node3 node4
node6 External
node4 Internal node6
node0 Internal node1 node2 Root
node2 External

The nodes in in-order traversal are :

The nodes in preorder traversal are :

The nodes in postorder traversal are :

    - complete the code to traverse the tree using in-order, post-order and pre-order traversal.

    - compile and run.

>java tryBinaryTree1
node type left children right children comment
node3 Internal node5
node5 External
node1 Internal node3 node4
node6 External
node4 Internal node6
node0 Internal node1 node2 Root
node2 External

The nodes in in-order traversal are :
node3 node5 node1 node6 node4 node0 node2

The nodes in preorder traversal are :
node0 node1 node3 node5 node4 node6 node2

The nodes in postorder traversal are :
node5 node3 node6 node4 node1 node2 node0

3) General tree to Binary tree. examples

Extra:

4) Exercise 6.8 Euler tour and calculating balance factor. here