Scribd
Upload
34 views

Binary Tree

The document discusses different methods for traversing binary trees, including preorder, inorder, postorder, and level order traversal. It provides code examples and explanations of how each traversal method works. It also discusses how to reconstruct a binary tree given different combinations of traversal sequences.

Uploaded by

manishbhardwaj8131
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
34 views

Binary Tree

The document discusses different methods for traversing binary trees, including preorder, inorder, postorder, and level order traversal. It provides code examples and explanations of how each traversal method works. It also discusses how to reconstruct a binary tree given different combinations of traversal sequences.

Uploaded by

manishbhardwaj8131
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 14

Binary Tree Traversal Methods

In a traversal of a binary tree, each element of the binary tree is visited exactly once. During the visit of an element, all action (make a clone, display, evaluate the operator, etc.) with respect to this element is taken.

Binary Tree Traversal Methods


Preorder Inorder Postorder Level order

Preorder Traversal
public static void preOrder(BinaryTreeNode t) { if (t != null) { visit(t); preOrder(t.leftChild); preOrder(t.rightChild); } }

Preorder Example (visit = print)


a b c

abc

Preorder Example (visit = print)


a b d g h e i f j c

abdghei cf j

Preorder Of Expression Tree


/ * e + a b c d + f

/ * +a b - c d +e f Gives prefix form of expression!

Inorder Traversal
public static void inOrder(BinaryTreeNode t) { if (t != null) { inOrder(t.leftChild); visit(t); inOrder(t.rightChild); } }

Inorder Example (visit = print)


a b c

bac

Inorder Example (visit = print)


a b d g h e i f j c

gdhbei af j c

Inorder By Projection (Squishing)


a b d g h e i f j c

g d h

i a

f jc

Inorder Of Expression Tree


/ * e + a b c d e + f + f

a + b

* c - d/

Gives infix form of expression (sans parentheses)!

Postorder Traversal
public static void postOrder(BinaryTreeNode t) { if (t != null) { postOrder(t.leftChild); postOrder(t.rightChild); visit(t); } }

Postorder Example (visit = print)


a b c

bca

Postorder Example (visit = print)


a b d g h e i f j c

ghdi ebj f ca

Level Order
Let t be the tree root. while (t != null) { visit t and put its children on a FIFO queue; remove a node from the FIFO queue and call it t; // remove returns null when queue is empty }

Level-Order Example (visit = print)


a b d g h e i f j c

abcdef ghi j

Binary Tree Construction


Suppose that the elements in a binary tree are distinct. Can you construct the binary tree from which a given traversal sequence came? When a traversal sequence has more than one element, the binary tree is not uniquely defined. Therefore, the tree from which the sequence was obtained cannot be reconstructed uniquely.

Some Examples
preorder = ab inorder = ab postorder = ab level order = ab
a b b a b a a b a b b a a b a b

Binary Tree Construction


Can you construct the binary tree, given two traversal sequences? Depends on which two sequences are given.

Preorder And Postorder


preorder = ab postorder = ba
b a a b

Preorder and postorder do not uniquely define a binary tree. Nor do preorder and level order (same example). Nor do postorder and level order (same example).

Inorder And Preorder


inorder = g d h b e i a f j c preorder = a b d g h e i c f j Scan the preorder left to right using the inorder to separate left and right subtrees. a is the root of the tree; gdhbei are in the left subtree; fjc are in the right subtree.
a gdhbei fjc

Inorder And Preorder


a gdhbei fjc

preorder = a b d g h e i c f j b is the next root; gdh are in the left subtree; ei are in the right subtree.
a b gdh ei fjc

Inorder And Preorder


a b gdh ei fjc

preorder = a b d g h e i c f j d is the next root; g is in the left subtree; h is in the right subtree.
a b d g h ei fjc

Inorder And Postorder


Scan postorder from right to left using inorder to separate left and right subtrees.

inorder = g d h b e i a f j c postorder = g h d i e b j f c a
Tree root is a; gdhbei are in left subtree; fjc are in right subtree.

Inorder And Level Order


Scan level order from left to right using inorder to separate left and right subtrees.

inorder = g d h b e i a f j c level order = a b c d e f g h i j


Tree root is a; gdhbei are in left subtree; fjc are in right subtree.

You might also like