- This project contains algorithms that do operations using traversals on Binary Trees.
- balanced() algorithm checks if the tree is balanced or not.
- floor(int x) algorithm returns the rightmost node with a key less than or equal to the input (x).
- keysAtDepth(int d) algorithm returns likend list that contains the keys at a given depth (d).
-
Notifications
You must be signed in to change notification settings - Fork 0
Munkh09/Binary_Tree_Algorithms
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
This project contains algorithms that perform useful operations utilizing traversals on Binary Trees.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published