data_structures.binary_tree.diameter_of_binary_tree
===================================================

.. py:module:: data_structures.binary_tree.diameter_of_binary_tree

.. autoapi-nested-parse::

   The diameter/width of a tree is defined as the number of nodes on the longest path
   between two end nodes.



Attributes
----------

.. autoapisummary::

   data_structures.binary_tree.diameter_of_binary_tree.root


Classes
-------

.. autoapisummary::

   data_structures.binary_tree.diameter_of_binary_tree.Node


Module Contents
---------------

.. py:class:: Node

   .. py:method:: depth() -> int

      >>> root = Node(1)
      >>> root.depth()
      1
      >>> root.left = Node(2)
      >>> root.depth()
      2
      >>> root.left.depth()
      1
      >>> root.right = Node(3)
      >>> root.depth()
      2



   .. py:method:: diameter() -> int

      >>> root = Node(1)
      >>> root.diameter()
      1
      >>> root.left = Node(2)
      >>> root.diameter()
      2
      >>> root.left.diameter()
      1
      >>> root.right = Node(3)
      >>> root.diameter()
      3



   .. py:attribute:: data
      :type:  int


   .. py:attribute:: left
      :type:  Node | None
      :value: None



   .. py:attribute:: right
      :type:  Node | None
      :value: None



.. py:data:: root