Skip to content
#

tree-traversal

Here are 16 public repositories matching this topic...

dsa

This repository offers a robust implementation of an AVL tree (balanced binary search tree) in Python, encapsulated within the Node and Tree classes. It includes methods for building the tree (build_tree()), inserting nodes (insert()), and deleting nodes (delete()). The implementation ensures that the tree remains balanced, optimizing performance.

  • Updated Sep 2, 2024
  • Python

Improve this page

Add a description, image, and links to the tree-traversal topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the tree-traversal topic, visit your repo's landing page and select "manage topics."

Learn more