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:18:21 +05:45 committed by GitHub
parent 8ce8fcfc12
commit 04e91d58d9
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 18 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

19
data_structures/binary_tree/basic_binary_tree.py
View File

@ -11,6 +11,23 @@ class Node:
self.left: Node | None = None self.left: Node | None = None
self.right: Node | None = None self.right: Node | None = None
def display(tree: Node | None) -> None: # In Order traversal of the tree
"""
>>> root = Node(1)
>>> root.left = Node(0)
>>> root.right = Node(2)
>>> display(root)
0
1
2
>>> display(root.right)
2
"""
if tree:
display(tree.left)
print(tree.data)
display(tree.right)
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:
""" """
@ -92,7 +109,7 @@ def main() -> None: # Main function for testing.
print(is_full_binary_tree(tree)) print(is_full_binary_tree(tree))
print(depth_of_tree(tree)) print(depth_of_tree(tree))
print("Tree is: ") print("Tree is: ")
display_tree(tree) display_using_in_order_traversal(tree)
if __name__ == "__main__": if __name__ == "__main__":