https://github.com/anishsinha-io/binarysearchtree

implements binary search tree, breadth first traversal algorithms, depth first traversal algorithms (both iterative and recursive), and search
https://github.com/anishsinha-io/binarysearchtree

Last synced: 17 days ago
JSON representation

implements binary search tree, breadth first traversal algorithms, depth first traversal algorithms (both iterative and recursive), and search

• Host: GitHub
• URL: https://github.com/anishsinha-io/binarysearchtree
• Owner: anishsinha-io
• Created: 2022-01-10T07:28:43.000Z (over 3 years ago)
• Default Branch: master
• Last Pushed: 2022-01-16T05:47:21.000Z (over 3 years ago)
• Last Synced: 2025-05-25T09:39:39.887Z (about 2 months ago)
• Language: C
• Size: 8.79 KB
• Stars: 1
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Binary Search Trees

This repository contains an implementation for a binary search tree, as well as algorithms for breadth first traversal

and depth first traversal. For depth first traversal, both iterative and recursive solutions are implemented. Search (

obviously) is also implemented.