kaelwebdev / binary_trees

0x1D. C - Binary trees

Resources:books:

Read or watch:

• Binary tree
• Data Structure and Algorithms - Tree
• Tree Traversal
• Binary Search Tree
• Data structures: Binary Tree

---

Learning Objectives:bulb:

What you should learn from this project:

• 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

---

0. New node

• Write a function that creates a binary tree node

1. Insert left

• Write a function that inserts a node as the left-child of another node

2. Insert right

• Write a function that inserts a node as the right-child of another node

3. Delete

• Write a function that deletes an entire binary tree

4. Is leaf

• Write a function that checks if a node is a leaf

5. Is root

• Write a function that checks if a given node is a root

6. Pre-order traversal

• Write a function that goes through a binary tree using pre-order traversal

7. In-order traversal

• Write a function that goes through a binary tree using in-order traversal

8. Post-order traversal

• Write a function that goes through a binary tree using post-order traversal

9. Height

• Write a function that measures the height of a binary tree

10. Depth

• Write a function that measures the depth of a node in a binary tree

11. Size

• Write a function that measures the size of a binary tree

12. Leaves

• Write a function that counts the leaves in a binary tree

13. Nodes

• Write a function that counts the nodes with at least 1 child in a binary tree

14. Balance factor

• Write a function that measures the balance factor of a binary tree

15. Is full

• Write a function that checks if a binary tree is full

16. Is perfect

• Write a function that checks if a binary tree is perfect

17. Sibling

• Write a function that finds the sibling of a node

18. Uncle

• Write a function that finds the uncle of a node

19. Lowest common ancestor

• Write a function that finds the lowest common ancestor of two nodes

20. Level-order traversal

• Write a function that goes through a binary tree using level-order traversal

21. Is complete

• Write a function that checks if a binary tree is complete

22. Rotate left

• Write a function that performs a left-rotation on a binary tree

23. Rotate right

• Write a function that performs a right-rotation on a binary tree

24. Is BST

• Write a function that checks if a binary tree is a valid Binary Search Tree

25. BST - Insert

• Write a function that inserts a value in a Binary Search Tree

26. BST - Array to BST

• Write a function that builds a Binary Search Tree from an array

27. BST - Search

• Write a function that searches for a value in a Binary Search Tree

28. BST - Remove

• Write a function that removes a node from a Binary Search Tree

29. Big O #BST

• What are the average time complexities of those operations on a Binary Search Tree (one answer per line):

30. Is AVL

• Write a function that checks if a binary tree is a valid AVL Tree

31. AVL - Insert

• Write a function that inserts a value in an AVL Tree

32. AVL - Array to AVL

• Write a function that builds an AVL tree from an array

33. AVL - Remove

• Write a function that removes a node from an AVL tree

34. AVL - From sorted array

• Write a function that builds an AVL tree from an array

35. Big O #AVL Tree

• What are the average time complexities of those operations on an AVL Tree (one answer per line):

36. Is Binary heap

• Write a function that checks if a binary tree is a valid Max Binary Heap

37. Heap - Insert

• Write a function that inserts a value in Max Binary Heap

38. Heap - Array to Binary Heap

• Write a function that builds a Max Binary Heap tree from an array

39. Heap - Extract

• Write a function that extracts the root node of a Max Binary Heap

40. Heap - Sort

• Write a function that converts a Binary Max Heap to a sorted array of integers

41. Big O #Binary Heap

• What are the average time complexities of those operations on a Binary Heap (one answer per line):

---

Author

• Carlos Daniel Cortez - kael1706