python-algorithms/algorithms/tree/bst/height.py at master · plumnx/python-algorithms · GitHub

History

60 lines (49 loc) · 1.41 KB

Raw

"""

Write a function height returns the height of a tree. The height is defined to

be the number of levels. The empty tree has height 0, a tree of one node has

height 1, a root node with one or two leaves as children has height 2, and so on

For example: height of tree is 4

/ \

6 12

/ \ / \

3 8 10 15

/ \

7 18

height = 4

"""

import unittest

from bst import Node

from bst import bst

def height(root):

if root is None:

return 0

else:

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

"""

The tree is created for testing:

/ \

6 12

/ \ / \

3 8 10 15

/ \

7 18

count_left_node = 4

"""

class TestSuite(unittest.TestCase):

def setUp(self):

self.tree = bst()

self.tree.insert(9)

self.tree.insert(6)

self.tree.insert(12)

self.tree.insert(3)

self.tree.insert(8)

self.tree.insert(10)

self.tree.insert(15)

self.tree.insert(7)

self.tree.insert(18)

def test_height(self):

self.assertEqual(4, height(self.tree.root))

if __name__ == '__main__':

unittest.main()

python-algorithms/algorithms/tree/bst/height.py at master · plumnx/python-algorithms · GitHub

Expand file tree

Breadcrumbs

height.py

Latest commit

History

Breadcrumbs

height.py

File metadata and controls