





import argparse
import datetime





def     _UpperCamelCase     (a__   :str       ):






							"""simple docstring"""





							UpperCamelCase__				     =			{
							    """0""": """Sunday""",
							    """1""": """Monday""",
							    """2""": """Tuesday""",
							    """3""": """Wednesday""",
							    """4""": """Thursday""",
							    """5""": """Friday""",
							    """6""": """Saturday""",
							}

							UpperCamelCase__				     =			{0: 1, 1: 2, 2: 3, 3: 4, 4: 5, 5: 6, 6: 0}

							# Validate
							if not 0 < len(a__       ) < 11:
														raise ValueError("""Must be 10 characters long"""       )

							# Get month
							UpperCamelCase__				     =			int(date_input[0] + date_input[1]       )
							# Validate
							if not 0 < m < 13:
														raise ValueError("""Month must be between 1 - 12"""       )

							UpperCamelCase__				     =			date_input[2]
							# Validate
							if sep_a not in ["-", "/"]:
														raise ValueError("""Date separator must be '-' or '/'"""       )

							# Get day
							UpperCamelCase__				     =			int(date_input[3] + date_input[4]       )
							# Validate
							if not 0 < d < 32:
														raise ValueError("""Date must be between 1 - 31"""       )

							# Get second separator
							UpperCamelCase__				     =			date_input[5]
							# Validate
							if sep_a not in ["-", "/"]:
														raise ValueError("""Date separator must be '-' or '/'"""       )

							# Get year
							UpperCamelCase__				     =			int(date_input[6] + date_input[7] + date_input[8] + date_input[9]       )
							# Arbitrary year range
							if not 45 < y < 8500:
														raise ValueError(
														    """Year out of range. There has to be some sort of limit...right?"""       )

							# Get datetime obj for validation
							UpperCamelCase__				     =			datetime.date(int(a__       )   ,			int(a__       )   ,			int(a__       )       )

							# Start math
							if m <= 2:
														UpperCamelCase__				     =			y - 1
														UpperCamelCase__				     =			m + 12
							# maths var
							UpperCamelCase__				     =			int(str(a__       )[:2]       )
							UpperCamelCase__				     =			int(str(a__       )[2:]       )
							UpperCamelCase__				     =			int(2.6 * m - 5.39       )
							UpperCamelCase__				     =			int(c / 4       )
							UpperCamelCase__				     =			int(k / 4       )
							UpperCamelCase__				     =			int(d + k       )
							UpperCamelCase__				     =			int(t + u + v + x       )
							UpperCamelCase__				     =			int(z - (2 * c)       )
							UpperCamelCase__				     =			round(w % 7       )
							# End math

							# Validate math
							if f != convert_datetime_days[dt_ck.weekday()]:
														raise AssertionError("""The date was evaluated incorrectly. Contact developer."""       )

							# Response
							UpperCamelCase__				     =			f"""Your date {date_input}, is a {days[str(a__       )]}!"""
							return response


if __name__ == "__main__":
					import doctest

					doctest.testmod()
					UpperCamelCase__											= argparse.ArgumentParser(
					    description=(
					        "Find out what day of the week nearly any date is or was. Enter "
					        "date as a string in the mm-dd-yyyy or mm/dd/yyyy format"
					    )
					)
					parser.add_argument(
					    "date_input", type=str, help="Date as a string (mm-dd-yyyy or mm/dd/yyyy)"
					)
					UpperCamelCase__											= parser.parse_args()
					zeller(args.date_input)











from __future__ import annotations

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

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






def     _UpperCamelCase     ():






							"""simple docstring"""





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





def     _UpperCamelCase     (a__   :Node | None       ):






							"""simple docstring"""





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





def     _UpperCamelCase     (a__   :Node | None       ):






							"""simple docstring"""





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





def     _UpperCamelCase     (a__   :Node | None       ):






							"""simple docstring"""





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





def     _UpperCamelCase     (a__   :Node | None       ):






							"""simple docstring"""





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





def     _UpperCamelCase     (a__   :Node | None       ):






							"""simple docstring"""





							UpperCamelCase__				     =			[]

							if root is None:
														return output

							UpperCamelCase__				     =			deque([root]       )

							while process_queue:
														UpperCamelCase__				     =			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     _UpperCamelCase     (a__   :Node | None   ,			a__   :int       ):






							"""simple docstring"""





							UpperCamelCase__				     =			[]

							def populate_output(a__   :Node | None   ,			a__   :int       ) -> 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(a__   ,			a__       )
							return output





def     _UpperCamelCase     (a__   :Node | None   ,			a__   :int       ):






							"""simple docstring"""





							UpperCamelCase__				     =			[]

							def populate_output(a__   :Node | None   ,			a__   :int       ) -> 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(a__   ,			a__       )
							return output





def     _UpperCamelCase     (a__   :Node | None       ):






							"""simple docstring"""





							if root is None:
														return []

							UpperCamelCase__				     =			[]

							UpperCamelCase__				     =			0
							UpperCamelCase__				     =			height(a__       )

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

							return output





def     _UpperCamelCase     ():  # Main function for testing.






							"""simple docstring"""





							UpperCamelCase__				     =			make_tree()
							print(f"""In-order Traversal: {inorder(a__       )}"""       )
							print(f"""Pre-order Traversal: {preorder(a__       )}"""       )
							print(f"""Post-order Traversal: {postorder(a__       )}"""   ,			"""\n"""       )

							print(f"""Height of Tree: {height(a__       )}"""   ,			"""\n"""       )

							print("""Complete Level Order Traversal: """       )
							print(level_order(a__       )   ,			"""\n"""       )

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

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

							print("""\nZigZag order Traversal: """       )
							print(zigzag(a__       )       )


if __name__ == "__main__":
					import doctest

					doctest.testmod()
					main()




