






def 						a    (		lowerCamelCase_       ):






				'''simple docstring'''
				lowercase__     				=    abs(__UpperCamelCase       )
				lowercase__     				=    0
				while n > 0:
								res += n % 10
								n //= 10
				return res






def 						a    (		lowerCamelCase_       ):






				'''simple docstring'''
				lowercase__     				=    abs(__UpperCamelCase       )
				return n if n < 10 else n % 10 + sum_of_digits(n // 10       )






def 						a    (		lowerCamelCase_       ):






				'''simple docstring'''
				return sum(int(__UpperCamelCase       ) for c in str(abs(__UpperCamelCase       )       )       )






def 						a    (		):






				'''simple docstring'''
				from collections.abc import Callable
				from timeit import timeit

				def benchmark_a_function(lowerCamelCase_	,     lowerCamelCase_       ) -> None:
								lowercase__     				=    F"""{func.__name__}({value})"""
								lowercase__     				=    timeit(F"""__main__.{call}"""	,     setup='''import __main__'''       )
								print(F"""{call:56} = {func(__UpperCamelCase       )} -- {timing:.4f} seconds"""       )

				for value in (26_2144, 1125_8999_0684_2624, 126_7650_6002_2822_9401_4967_0320_5376):
								for func in (sum_of_digits, sum_of_digits_recursion, sum_of_digits_compact):
												benchmark_a_function(__UpperCamelCase	,     __UpperCamelCase       )
								print()


if __name__ == "__main__":
						import doctest

						doctest.testmod()
						benchmark()












from __future__ import annotations

from collections import deque
from collections.abc import Sequence
from dataclasses import dataclass
from typing import Any
@dataclass
class    _UpperCAmelCase      :

				"""simple docstring"""




				lowercase__       							= 42
				lowercase__       							= None
				lowercase__       							= None






def 						a    (		):






				'''simple docstring'''
				lowercase__     				=    Node(1       )
				lowercase__     				=    Node(2       )
				lowercase__     				=    Node(3       )
				lowercase__     				=    Node(4       )
				lowercase__     				=    Node(5       )
				return tree






def 						a    (		lowerCamelCase_       ):






				'''simple docstring'''
				return [root.data, *preorder(root.left       ), *preorder(root.right       )] if root else []






def 						a    (		lowerCamelCase_       ):






				'''simple docstring'''
				return postorder(root.left       ) + postorder(root.right       ) + [root.data] if root else []






def 						a    (		lowerCamelCase_       ):






				'''simple docstring'''
				return [*inorder(root.left       ), root.data, *inorder(root.right       )] if root else []






def 						a    (		lowerCamelCase_       ):






				'''simple docstring'''
				return (max(height(root.left       )	,     height(root.right       )       ) + 1) if root else 0






def 						a    (		lowerCamelCase_       ):






				'''simple docstring'''
				lowercase__     				=    []

				if root is None:
								return output

				lowercase__     				=    deque([root]       )

				while process_queue:
								lowercase__     				=    process_queue.popleft()
								output.append(node.data       )

								if node.left:
												process_queue.append(node.left       )
								if node.right:
												process_queue.append(node.right       )
				return output






def 						a    (		lowerCamelCase_	,     lowerCamelCase_       ):






				'''simple docstring'''
				lowercase__     				=    []

				def populate_output(lowerCamelCase_	,     lowerCamelCase_       ) -> None:
								if not root:
												return
								if level == 1:
												output.append(root.data       )
								elif level > 1:
												populate_output(root.left	,     level - 1       )
												populate_output(root.right	,     level - 1       )

				populate_output(lowerCamelCase_	,     lowerCamelCase_       )
				return output






def 						a    (		lowerCamelCase_	,     lowerCamelCase_       ):






				'''simple docstring'''
				lowercase__     				=    []

				def populate_output(lowerCamelCase_	,     lowerCamelCase_       ) -> None:
								if root is None:
												return
								if level == 1:
												output.append(root.data       )
								elif level > 1:
												populate_output(root.right	,     level - 1       )
												populate_output(root.left	,     level - 1       )

				populate_output(lowerCamelCase_	,     lowerCamelCase_       )
				return output






def 						a    (		lowerCamelCase_       ):






				'''simple docstring'''
				if root is None:
								return []

				lowercase__     				=    []

				lowercase__     				=    0
				lowercase__     				=    height(lowerCamelCase_       )

				for h in range(1	,     height_tree + 1       ):
								if not flag:
												output.append(get_nodes_from_left_to_right(lowerCamelCase_	,     lowerCamelCase_       )       )
												lowercase__     				=    1
								else:
												output.append(get_nodes_from_right_to_left(lowerCamelCase_	,     lowerCamelCase_       )       )
												lowercase__     				=    0

				return output






def 						a    (		):  # Main function for testing.






				'''simple docstring'''
				lowercase__     				=    make_tree()
				print(F"""In-order Traversal: {inorder(lowerCamelCase_       )}"""       )
				print(F"""Pre-order Traversal: {preorder(lowerCamelCase_       )}"""       )
				print(F"""Post-order Traversal: {postorder(lowerCamelCase_       )}"""	,     '''\n'''       )

				print(F"""Height of Tree: {height(lowerCamelCase_       )}"""	,     '''\n'''       )

				print('''Complete Level Order Traversal: '''       )
				print(level_order(lowerCamelCase_       )	,     '''\n'''       )

				print('''Level-wise order Traversal: '''       )

				for level in range(1	,     height(lowerCamelCase_       ) + 1       ):
								print(F"""Level {level}:"""	,     get_nodes_from_left_to_right(lowerCamelCase_	,     level=lowerCamelCase_       )       )

				print('''\nZigZag order Traversal: '''       )
				print(zigzag(lowerCamelCase_       )       )


if __name__ == "__main__":
							import doctest

							doctest.testmod()
							main()




