https://github.com/glenmiracle18/binary_trees

for the alx-se binary trees project
https://github.com/glenmiracle18/binary_trees

Last synced: 2 months ago
JSON representation

for the alx-se binary trees project

• Host: GitHub
• URL: https://github.com/glenmiracle18/binary_trees
• Owner: glenmiracle18
• Created: 2023-03-30T09:40:10.000Z (about 2 years ago)
• Default Branch: master
• Last Pushed: 2023-03-30T10:54:53.000Z (about 2 years ago)
• Last Synced: 2025-02-02T02:31:36.462Z (4 months ago)
• Language: C
• Size: 15.6 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
Learning Objectives

At the end of this project, you are expected to be able to explain to anyone, without the help of Google:

General

What is a binary tree

What is the difference between a binary tree and a Binary Search Tree

What is the possible gain in terms of time complexity compared to linked lists

What are the depth, the height, the size of a binary tree

What are the different traversal methods to go through a binary tree

What is a complete, a full, a perfect, a balanced binary tree