mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-02-25 02:18:39 +00:00
Code Issues Packages Projects Releases Wiki Activity

Update basic_binary_tree.py

Browse Source
This commit is contained in:
Diwas Dahal 2023-07-24 16:51:35 +05:45 committed by GitHub
parent 64939195c1
commit 02fe6955e5
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
data_structures/binary_tree/basic_binary_tree.py
View File

@ -33,12 +33,12 @@ def display(tree: Node | None) -> None: # In Order traversal of the tree
def display_using_in_order_traversal(root: Node | None, level: int = 0) -> None: def display_using_in_order_traversal(root: Node | None, level: int = 0) -> None:
""" """
>>> root = Node(1) >>> root = Node(1)
>>> root.left = Node(2) >>> root.left = Node(0)
>>> root.right = Node(3) >>> root.right = Node(2)
>>> display_tree(root) >>> display_tree(root)
3
1
2 2
1
0
""" """
if root: if root:
display_using_in_order_traversal(root.right, level + 1) display_using_in_order_traversal(root.right, level + 1)