mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-04-08 06:45:54 +00:00
Code Issues Packages Projects Releases Wiki Activity

imrpoved del_node(6)

Browse Source
This commit is contained in:
Shaurya Bisht 2024-10-13 10:13:54 +00:00
parent ae8735eb1a
commit c01e6e5041
1 changed files with 9 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
data_structures/binary_tree/avl_tree.py
View File

@ -10,7 +10,7 @@ from __future__ import annotations
import math import math
import random import random
from typing import Any, Optional from typing import Any
class MyQueue: class MyQueue:
@ -195,17 +195,19 @@ def get_left_most(root: MyNode) -> Any:
return root.get_data() return root.get_data()
def get_balance(node: MyNode) -> int: def get_balance(node: MyNode | None) -> int:
if node is None: if node is None:
return 0 return 0
return get_height(node.get_left()) - get_height(node.get_right()) return get_height(node.get_left()) - get_height(node.get_right())
def get_min_value_node(node: MyNode) -> MyNode: def get_min_value_node(node: MyNode | None) -> MyNode | None:
current = node if node is None:
while current.get_left() is not None: return None
current = current.get_left() current_node = node
return current while current_node.get_left() is not None:
current_node = current_node.get_left()
return current_node
def del_node(root: MyNode | None, data: Any) -> MyNode | None: def del_node(root: MyNode | None, data: Any) -> MyNode | None: