dickens92 / binary_trees Goto Github PK

0x1D. C -BIRNARY TREES

LEARNING OBJECTIVES

$ 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

0. a function that creates a binary tree node
1. a function that inserts a node as the left-child of another node
2. a function that inserts a node as the right-child of another node
3. a function that deletes an entire binary tree
4. a function that checks if a node is a leaf
5. a function that checks if a given node is a root
6. a function that goes through a binary tree using pre-order traversal
7. a function that goes through a binary tree using in-order traversal
8. a function that goes through a binary tree using post-order traversal
9. a function that measures the height of a binary tree
10. a function that measures the depth of a node in a binary tree
11. a function that measures the size of a binary tree
12. a function that counts the leaves in a binary tree
13. a function that counts the nodes with at least 1 child in a binary tree
14. a function that measures the balance factor of a binary tree
15. a function that checks if a binary tree is full
16. a function that checks if a binary tree is perfect
17. a function that finds the sibling of a node
18. a function that finds the uncle of a node

The rest are Advanced tasks.