Skip to content

khuloud0/holbertonschool-binary_trees

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

26 Commits
0-binary_tree_node.c
0-binary_tree_node.c
 
 
0-main.c
0-main.c
 
 
0-node
0-node
 
 
1-binary_tree_insert_left.c
1-binary_tree_insert_left.c
 
 
1-left
1-left
 
 
1-main.c
1-main.c
 
 
10-binary_tree_depth.c
10-binary_tree_depth.c
 
 
10-depth
10-depth
 
 
10-main.c
10-main.c
 
 
11-binary_tree_size.c
11-binary_tree_size.c
 
 
11-main.c
11-main.c
 
 
11-size
11-size
 
 
12-binary_tree_leaves.c
12-binary_tree_leaves.c
 
 
12-leaves
12-leaves
 
 
12-main.c
12-main.c
 
 
13-binary_tree_nodes.c
13-binary_tree_nodes.c
 
 
13-main.c
13-main.c
 
 
13-nodes
13-nodes
 
 
14-balance
14-balance
 
 
14-binary_tree_balance.c
14-binary_tree_balance.c
 
 
14-main.c
14-main.c
 
 
15-binary_tree_is_full.c
15-binary_tree_is_full.c
 
 
15-full
15-full
 
 
15-main.c
15-main.c
 
 
16-binary_tree_is_perfect.c
16-binary_tree_is_perfect.c
 
 
16-main.c
16-main.c
 
 
16-perfect
16-perfect
 
 
17-binary_tree_sibling.c
17-binary_tree_sibling.c
 
 
17-main.c
17-main.c
 
 
17-sibling
17-sibling
 
 
18-binary_tree_uncle.c
18-binary_tree_uncle.c
 
 
18-main.c
18-main.c
 
 
18-uncle
18-uncle
 
 
2-binary_tree_insert_right.c
2-binary_tree_insert_right.c
 
 
2-main.c
2-main.c
 
 
2-right
2-right
 
 
3-binary_tree_delete.c
3-binary_tree_delete.c
 
 
3-del
3-del
 
 
3-main.c
3-main.c
 
 
4-binary_tree_is_leaf.c
4-binary_tree_is_leaf.c
 
 
4-leaf
4-leaf
 
 
4-main.c
4-main.c
 
 
5-binary_tree_is_root.c
5-binary_tree_is_root.c
 
 
5-main.c
5-main.c
 
 
5-root
5-root
 
 
6-binary_tree_preorder.c
6-binary_tree_preorder.c
 
 
6-main.c
6-main.c
 
 
6-pre
6-pre
 
 
7-binary_tree_inorder.c
7-binary_tree_inorder.c
 
 
7-in
7-in
 
 
7-main.c
7-main.c
 
 
8-binary_tree_postorder.c
8-binary_tree_postorder.c
 
 
8-main.c
8-main.c
 
 
8-post
8-post
 
 
9-binary_tree_height.c
9-binary_tree_height.c
 
 
9-height
9-height
 
 
9-main.c
9-main.c
 
 
README.md
README.md
 
 
binary_tree_print.c
binary_tree_print.c
 
 
binary_trees.h
binary_trees.h
 
 
core.140
core.140
 
 
core.156
core.156
 
 
core.173
core.173
 
 
core.190
core.190
 
 
core.207
core.207
 
 
core.235
core.235
 
 
core.269
core.269
 
 

Repository files navigation

0x1D. C - Binary Trees

📘 Description

This project is part of the Holberton School curriculum.
It focuses on the implementation and understanding of binary trees using the C programming language.

You will learn how to create, traverse, and manipulate binary trees, and understand the key differences between binary trees and other data structures such as linked lists and Binary Search Trees (BST).

This project is done in teams of two people: Team members: Banan Ahmed Aleid & Khulood Hamdan Alqahtani

🎯 Learning Objectives

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

General

  • What is a binary tree
  • What is the difference between a binary tree and a Binary Search Tree (BST)
  • What is the possible gain in terms of time complexity compared to linked lists
  • What are the depth, height, and size of a binary tree
  • What are the different traversal methods (pre-order, in-order, post-order)
  • What is a complete, full, perfect, and balanced binary tree

⚙️ Compilation

All your files will be compiled using the following flags:

gcc -Wall -Wextra -Werror -pedantic -std=gnu89 *.c -o binary_trees

About

No description, website, or topics provided.

Resources

Readme
Activity

Stars

0 stars

Watchers

0 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

 
 
 

Contributors

Languages