Given a binary tree where each node can have at most two child nodes, the task is to find the Euler tour of the binary tree. Euler tour is represented by a pointer to the topmost node in the tree. If the tree is empty, then value of root is NULL.
Output: 1 5 4 2 4 3 4 5 1
(1) First, start with root node 1, Euler=1
(2) Go to left node i.e, node 5, Euler=5
(3) Go to left node i.e, node 4, Euler=4
(4) Go to left node i.e, node 2, Euler=2
(5) Go to left node i.e, NULL, go to parent node 4 Euler=4
(6) Go to right node i.e, node 3 Euler=3
(7) No child, go to parent, node 4 Euler=4
(8) All child discovered, go to parent node 5 Euler=5
(9) All child discovered, go to parent node 1 Euler=1
Euler tour of tree has been already discussed where it can be applied to N-ary tree which is represented by adjacency list. If a Binary tree is represented by the classical structured way by links and nodes, then there need to first convert the tree into adjacency list representation and then we can find the Euler tour if we want to apply method discussed in the original post. But this increases the space complexity of the program. Here, In this post, a generalized space-optimized version is discussed which can be directly applied to binary trees represented by structure nodes.
This method :
(1) Works without the use of Visited arrays.
(2) Requires exactly 2*N-1 vertices to store Euler tour.
link brightness_4 code
// C++ program to find euler tour of binary tree
/* A tree node structure */
/* Utility function to create a new Binary Tree node */