Skip to content

husamahmud/binary_trees

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

25 Commits
0-binary_tree_node.c
0-binary_tree_node.c
 
 
1-binary_tree_insert_left.c
1-binary_tree_insert_left.c
 
 
10-binary_tree_depth.c
10-binary_tree_depth.c
 
 
100-binary_trees_ancestor.c
100-binary_trees_ancestor.c
 
 
101-binary_tree_levelorder.c
101-binary_tree_levelorder.c
 
 
102-binary_tree_is_complete.c
102-binary_tree_is_complete.c
 
 
103-binary_tree_rotate_left.c
103-binary_tree_rotate_left.c
 
 
104-binary_tree_rotate_right.c
104-binary_tree_rotate_right.c
 
 
11-binary_tree_size.c
11-binary_tree_size.c
 
 
110-binary_tree_is_bst.c
110-binary_tree_is_bst.c
 
 
111-bst_insert.c
111-bst_insert.c
 
 
112-array_to_bst.c
112-array_to_bst.c
 
 
113-bst_search.c
113-bst_search.c
 
 
114-bst_remove.c
114-bst_remove.c
 
 
115-O
115-O
 
 
12-binary_tree_leaves.c
12-binary_tree_leaves.c
 
 
120-binary_tree_is_avl.c
120-binary_tree_is_avl.c
 
 
121-avl_insert.c
121-avl_insert.c
 
 
125-O
125-O
 
 
13-binary_tree_nodes.c
13-binary_tree_nodes.c
 
 
130-binary_tree_is_heap.c
130-binary_tree_is_heap.c
 
 
131-heap_insert.c
131-heap_insert.c
 
 
132-array_to_heap.c
132-array_to_heap.c
 
 
135-O
135-O
 
 
14-binary_tree_balance.c
14-binary_tree_balance.c
 
 
15-binary_tree_is_full.c
15-binary_tree_is_full.c
 
 
16-binary_tree_is_perfect.c
16-binary_tree_is_perfect.c
 
 
17-binary_tree_sibling.c
17-binary_tree_sibling.c
 
 
18-binary_tree_uncle.c
18-binary_tree_uncle.c
 
 
2-binary_tree_insert_right.c
2-binary_tree_insert_right.c
 
 
3-binary_tree_delete.c
3-binary_tree_delete.c
 
 
4-binary_tree_is_leaf.c
4-binary_tree_is_leaf.c
 
 
5-binary_tree_is_root.c
5-binary_tree_is_root.c
 
 
6-binary_tree_preorder.c
6-binary_tree_preorder.c
 
 
7-binary_tree_inorder.c
7-binary_tree_inorder.c
 
 
8-binary_tree_postorder.c
8-binary_tree_postorder.c
 
 
9-binary_tree_height.c
9-binary_tree_height.c
 
 
README.md
README.md
 
 
binary_trees.h
binary_trees.h
 
 

Repository files navigation

Project: 0x1D. C - Binary trees

Resources

Read or watch:

Learning Objectives

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

Tasks

Task File
0. New node SOON
1. Insert left SOON
2. Insert right SOON
3. Delete SOON
4. Is leaf SOON
5. Is root SOON
6. Pre-order traversal SOON
7. In-order traversal SOON
8. Post-order traversal SOON
9. Height SOON
10. Depth SOON
11. Size SOON
12. Leaves SOON
13. Nodes SOON
14. Balance factor SOON
15. Is full SOON
16. Is perfect SOON
17. Sibling SOON
18. Uncle SOON
19. Lowest common ancestor SOON
20. Level-order traversal SOON
21. Is complete SOON
22. Rotate left SOON
23. Rotate right SOON
24. Is BST SOON
25. BST - Insert SOON
26. BST - Array to BST SOON
27. BST - Search SOON
28. BST - Remove SOON
29. Big O #BST SOON
30. Is AVL SOON
31. AVL - Insert SOON
32. AVL - Array to AVL SOON
33. AVL - Remove SOON
34. AVL - From sorted array SOON
35. Big O #AVL Tree SOON
36. Is Binary heap SOON
37. Heap - Insert SOON
38. Heap - Array to Binary Heap SOON
39. Heap - Extract SOON
40. Heap - Sort SOON
41. Big O #Binary Heap SOON

About

ALX project In the context of binary trees

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

 
 
 

Languages