https://github.com/nikasulo/super-balanced-tree

An algorithm that checks if a tree is super balanced
https://github.com/nikasulo/super-balanced-tree

Last synced: 4 months ago
JSON representation

An algorithm that checks if a tree is super balanced

• Host: GitHub
• URL: https://github.com/nikasulo/super-balanced-tree
• Owner: nikasulo
• Created: 2021-07-25T14:35:01.000Z (almost 5 years ago)
• Default Branch: master
• Last Pushed: 2021-07-25T14:40:30.000Z (almost 5 years ago)
• Last Synced: 2026-01-14T13:52:14.910Z (6 months ago)
• Language: Go
• Size: 3.91 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
# super-balanced-tree

An algorithm that checks if a tree is super balanced

## What is a super balanced tree?

A tree is "superbalanced" if the difference between the depths of any two leaf nodes ↴ is no greater than one.

## What is a leaf node?

A leaf node is a tree node with no children.

It's the "end" of a path to the bottom, from the root.

#### This algorithm is the bi-product of solving this [problem](https://www.interviewcake.com/question/ruby/balanced-binary-tree?course=fc1&section=trees-graphs) on [Interview Cake](https://www.interviewcake.com/), my new favourite resource to keep me challenged