@@ -77,20 +77,29 @@ def level_order(node):
77
77
q .put (node_dequeued .right )
78
78
79
79
80
- node = build_tree ()
80
+ if __name__ == '__main__' :
81
+ import sys
82
+ print ("\n ********* Binary Tree Traversals ************\n " )
83
+ # For python 2.x and 3.x compatibility: 3.x has not raw_input builtin
84
+ # otherwise 2.x's input builtin function is too "smart"
85
+ if sys .version_info .major < 3 :
86
+ input_function = raw_input
87
+ else :
88
+ input_function = input
81
89
82
- print ("\n ********* Pre Order Traversal ************" )
83
- pre_order (node )
84
- print ("\n ******************************************\n " )
90
+ node = build_tree ()
91
+ print ("\n ********* Pre Order Traversal ************" )
92
+ pre_order (node )
93
+ print ("\n ******************************************\n " )
85
94
86
- print ("\n ********* In Order Traversal ************" )
87
- in_order (node )
88
- print ("\n ******************************************\n " )
95
+ print ("\n ********* In Order Traversal ************" )
96
+ in_order (node )
97
+ print ("\n ******************************************\n " )
89
98
90
- print ("\n ********* Post Order Traversal ************" )
91
- post_order (node )
92
- print ("\n ******************************************\n " )
99
+ print ("\n ********* Post Order Traversal ************" )
100
+ post_order (node )
101
+ print ("\n ******************************************\n " )
93
102
94
- print ("\n ********* Level Order Traversal ************" )
95
- level_order (node )
96
- print ("\n ******************************************\n " )
103
+ print ("\n ********* Level Order Traversal ************" )
104
+ level_order (node )
105
+ print ("\n ******************************************\n " )
0 commit comments