https://github.com/abdurahman-hassan/binary_trees

This repository, binary_trees, is a collaborative educational project created by students of Holberton School and ALX AFRICA. It serves as a comprehensive resource for learning and implementing binary trees, a fundamental concept in computer science.
https://github.com/abdurahman-hassan/binary_trees

Last synced: about 2 months ago
JSON representation

This repository, binary_trees, is a collaborative educational project created by students of Holberton School and ALX AFRICA. It serves as a comprehensive resource for learning and implementing binary trees, a fundamental concept in computer science.

• Host: GitHub
• URL: https://github.com/abdurahman-hassan/binary_trees
• Owner: Abdurahman-hassan
• Created: 2024-01-29T22:33:09.000Z (11 months ago)
• Default Branch: main
• Last Pushed: 2024-02-01T20:40:23.000Z (11 months ago)
• Last Synced: 2024-02-02T18:57:17.436Z (11 months ago)
• Language: C
• Size: 180 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# binary_trees

This repository, binary_trees, is a collaborative educational project created by students of Holberton School and ALX AFRICA. It serves as a comprehensive resource for learning and implementing binary trees, a fundamental concept in computer science.

Binary trees are a type of hierarchical data structure where each node has at most two children. There are several types of binary trees, each with its unique characteristics:

1. Full Binary Tree: A full binary tree is a special type of binary tree in which every parent node/internal node has either two or no children.

2. Perfect Binary Tree: A perfect binary tree is a type of binary tree in which every internal node has exactly two child nodes and all the leaf nodes are at the same level.

3. Balanced Binary Tree: A balanced binary tree is a binary tree structure in which the left and right subtrees of every node differ in height by no more than.

4. Complete Binary Tree: A complete binary tree is a binary tree in which every level, except possibly the last, is completely filled, and all nodes in the last level are as far left as possible.

5. Degenerate Binary Tree: A binary tree is said to be a degenerate binary tree or pathological binary tree if every internal node has only a single child.

## Functions

Here are some functions you need to write for this project:

1. `binary_tree_t *binary_tree_node(binary_tree_t *parent, int value);` - Creates a new binary tree node with the given value. Returns a pointer to the new node, or NULL on failure.

2. `binary_tree_t *binary_tree_insert_left(binary_tree_t *parent, int value);` - Inserts a new node as the left child of the given parent node. Returns a pointer to the new node, or NULL on failure or if the parent is NULL.

3. `binary_tree_t *binary_tree_insert_right(binary_tree_t *parent, int value);` - Inserts a new node as the right child of the given parent node. Returns a pointer to the new node, or NULL on failure or if the parent is NULL.

4. `void binary_tree_delete(binary_tree_t *tree);` - Deletes an entire binary tree. Does nothing if the tree is NULL.

5. `int binary_tree_is_leaf(const binary_tree_t *node);` - Checks if a node is a leaf. Returns 1 if the node is a leaf, 0 otherwise. If the node is NULL, returns 0.

6. `int binary_tree_is_root(const binary_tree_t *node);` - Checks if a node is the root. Returns 1 if the node is the root, 0 otherwise. If the node is NULL, returns 0.

7. `void binary_tree_preorder(const binary_tree_t *tree, void (*func)(int));` - Traverses a binary tree in pre-order (root, left, right) and calls the given function for each node. Does nothing if the tree or the function is NULL.

8. `void binary_tree_inorder(const binary_tree_t *tree, void (*func)(int));` - Traverses a binary tree in in-order (left, root, right) and calls the given function for each node. Does nothing if the tree or the function is NULL.

9. `void binary_tree_postorder(const binary_tree_t *tree, void (*func)(int));` - Traverses a binary tree in post-order (left, right, root) and calls the given function for each node. Does nothing if the tree or the function is NULL.

10. `size_t binary_tree_height(const binary_tree_t *tree);` - Measures the height of a binary tree. Returns 0 if the tree is NULL.

11. `size_t binary_tree_depth(const binary_tree_t *tree);` - Measures the depth of a node in a binary tree. Returns 0 if the tree is NULL.

12. `size_t binary_tree_size(const binary_tree_t *tree);` - Measures the size of a binary tree. Returns 0 if the tree is NULL.

13. `size_t binary_tree_leaves(const binary_tree_t *tree);` - Counts the leaves in a binary tree. Returns 0 if the tree is NULL. A NULL pointer is not considered a leaf.

14. `size_t binary_tree_nodes(const binary_tree_t *tree);` - Counts the nodes with at least 1 child in a binary tree. Returns 0 if the tree is NULL. A NULL pointer is not considered a node.

15. `int binary_tree_balance(const binary_tree_t *tree);` - Measures the balance factor of a binary tree. Returns 0 if the tree is NULL.

16. `int binary_tree_is_full(const binary_tree_t *tree);` - Checks if a binary tree is full. Returns 0 if the tree is NULL.

17. `int binary_tree_is_perfect(const binary_tree_t *tree);` - Checks if a binary tree is perfect. Returns 0 if the tree is NULL.

18. `binary_tree_t *binary_tree_sibling(binary_tree_t *node);` - Finds the sibling of a node. Returns a pointer to the sibling node, or NULL if the node is NULL or the parent is NULL, or if the node has no sibling.

19. `binary_tree_t *binary_tree_uncle(binary_tree_t *node);` - Finds the uncle of a node. Returns a pointer to the uncle node, or NULL if the node is NULL or the node has no uncle.

Each function should be written in accordance with the specifications provided in the question. Remember to handle edge cases appropriately, such as when the input tree is NULL or when a node has no sibling or uncle.