






def _UpperCAmelCase   (	a						:	Optional[Any]  ,					a						:	Dict ):
       snake_case__	  =       len(lowerCAmelCase__ )
       print("""The following activities are selected:""" )

       # The first activity is always selected
       snake_case__	  =       0
       print(lowerCAmelCase__  ,					end=""",""" )

       # Consider rest of the activities
       for j in range(lowerCAmelCase__ ):
              # If this activity has start time greater than
              # or equal to the finish time of previously
              # selected activity, then select it
              if start[j] >= finish[i]:
                     print(lowerCAmelCase__  ,					end=""",""" )
                     snake_case__	  =       j


if __name__ == "__main__":
 import doctest

 doctest.testmod()

 a__       =     [1, 3, 0, 5, 8, 5]
 a__       =     [2, 4, 6, 7, 9, 9]
 print_max_activities(start, finish)








from __future__ import annotations


class    _lowerCAmelCase			:



				"""simple docstring"""



				def __init__(      self    :    Optional[int]			,		UpperCamelCase__    :    int):






											'''simple docstring'''







											snake_case__	  =       data
											snake_case__	  =       None
											snake_case__	  =       None


def _UpperCAmelCase   (	a						:	Node | None ):  # In Order traversal of the tree
							if tree:
														display(tree.left )
														print(tree.data )
														display(tree.right )

def _UpperCAmelCase   (	a						:	Node | None ):
							return 1 + max(depth_of_tree(tree.left )  ,					depth_of_tree(tree.right ) ) if tree else 0

def _UpperCAmelCase   (	a						:	Node ):
							if not tree:
														return True
							if tree.left and tree.right:
														return is_full_binary_tree(tree.left ) and is_full_binary_tree(tree.right )
							else:
														return not tree.left and not tree.right

def _UpperCAmelCase   (	):  # Main function for testing.
							snake_case__	  =       Node(1 )
							snake_case__	  =       Node(2 )
							snake_case__	  =       Node(3 )
							snake_case__	  =       Node(4 )
							snake_case__	  =       Node(5 )
							snake_case__	  =       Node(6 )
							snake_case__	  =       Node(7 )
							snake_case__	  =       Node(8 )
							snake_case__	  =       Node(9 )

							print(is_full_binary_tree(a ) )
							print(depth_of_tree(a ) )
							print("""Tree is: """ )
							display(a )


if __name__ == "__main__":
	main()
