

from __future__ import annotations

from typing import Any







class 				lowercase       :




				def __init__(      self   ,     snake_case = 6 ):
											snake_case_           =					None
											snake_case_           =					None
											self.create_linked_list(a_ )




				def 					a							(      self   ,     snake_case ):
											snake_case_           =					Node()
											snake_case_           =					current_node
											snake_case_           =					current_node
											snake_case_           =					current_node
											for _ in range(1   ,     a_ ):
																		snake_case_           =					Node()
																		snake_case_           =					current_node
																		snake_case_           =					previous_node
																		snake_case_           =					current_node
											snake_case_           =					self.front
											snake_case_           =					previous_node




				def 					a							(      self ):
											return (
											    self.front == self.rear
											    and self.front is not None
											    and self.front.data is None
											)




				def 					a							(      self ):
											self.check_can_perform_operation()
											return self.front.data if self.front else None




				def 					a							(      self   ,     snake_case ):



											if self.rear is None:
																		return

											self.check_is_full()
											if not self.is_empty():
																		snake_case_           =					self.rear.next
											if self.rear:
																		snake_case_           =					data




				def 					a							(      self ):
											self.check_can_perform_operation()
											if self.rear is None or self.front is None:
																		return None
											if self.front == self.rear:
																		snake_case_           =					self.front.data
																		snake_case_           =					None
																		return data

											snake_case_           =					self.front
											snake_case_           =					old_front.next
											snake_case_           =					old_front.data
											snake_case_           =					None
											return data




				def 					a							(      self ):



											if self.is_empty():
																		raise Exception('Empty Queue' )




				def 					a							(      self ):



											if self.rear and self.rear.next == self.front:
																		raise Exception('Full Queue' )







class 				lowercase       :




				def __init__(      self ):
											snake_case_           =					None
											snake_case_           =					None
											snake_case_           =					None


if __name__ == "__main__":
					import doctest

					doctest.testmod()







from __future__ import annotations

from collections import deque
from collections.abc import Sequence
from dataclasses import dataclass
from typing import Any







@dataclass
class 				lowercase       :
				__SCREAMING_SNAKE_CASE      :				int
				__SCREAMING_SNAKE_CASE      :				Node | None     =    None
				__SCREAMING_SNAKE_CASE      :				Node | None     =    None





def       __lowerCamelCase			(				):







							'''simple docstring'''






							snake_case_           =					Node(1   )
							snake_case_           =					Node(2   )
							snake_case_           =					Node(3   )
							snake_case_           =					Node(4   )
							snake_case_           =					Node(5   )
							return tree





def       __lowerCamelCase			(				UpperCamelCase__   ):







							'''simple docstring'''






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





def       __lowerCamelCase			(				UpperCamelCase__   ):







							'''simple docstring'''






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





def       __lowerCamelCase			(				UpperCamelCase__   ):







							'''simple docstring'''






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





def       __lowerCamelCase			(				UpperCamelCase__   ):







							'''simple docstring'''






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





def       __lowerCamelCase			(				UpperCamelCase__   ):







							'''simple docstring'''






							snake_case_           =					[]

							if root is None:
														return output

							snake_case_           =					deque([root]   )

							while process_queue:
														snake_case_           =					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       __lowerCamelCase			(				UpperCamelCase__     ,							UpperCamelCase__   ):







							'''simple docstring'''






							snake_case_           =					[]

							def populate_output(UpperCamelCase__     ,							UpperCamelCase__   ) -> 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(UpperCamelCase__     ,							UpperCamelCase__   )
							return output





def       __lowerCamelCase			(				UpperCamelCase__     ,							UpperCamelCase__   ):







							'''simple docstring'''






							snake_case_           =					[]

							def populate_output(UpperCamelCase__     ,							UpperCamelCase__   ) -> 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(UpperCamelCase__     ,							UpperCamelCase__   )
							return output





def       __lowerCamelCase			(				UpperCamelCase__   ):







							'''simple docstring'''






							if root is None:
														return []

							snake_case_           =					[]

							snake_case_           =					0
							snake_case_           =					height(UpperCamelCase__   )

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

							return output





def       __lowerCamelCase			(				):  # Main function for testing.







							'''simple docstring'''






							snake_case_           =					make_tree()
							print(F'''In-order Traversal: {inorder(UpperCamelCase__   )}'''   )
							print(F'''Pre-order Traversal: {preorder(UpperCamelCase__   )}'''   )
							print(F'''Post-order Traversal: {postorder(UpperCamelCase__   )}'''     ,							'\n'   )

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

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

							print('Level-wise order Traversal: '   )

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

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


if __name__ == "__main__":
					import doctest

					doctest.testmod()
					main()




