0x1D. C - Binary trees
-
New node mandatory Write a function that creates a binary tree node
-
Insert left mandatory Write a function that inserts a node as the left-child of another node
-
Insert right mandatory Write a function that inserts a node as the right-child of another node
-
Delete mandatory Write a function that deletes an entire binary tree
-
Is leaf mandatory Write a function that checks if a node is a leaf
-
Is root mandatory Write a function that checks if a given node is a root
-
Pre-order traversal mandatory Write a function that goes through a binary tree using pre-order traversal
-
In-order traversal mandatory Write a function that goes through a binary tree using in-order traversal
-
Post-order traversal mandatory Write a function that goes through a binary tree using post-order traversal
-
Height mandatory Write a function that measures the height of a binary tree
-
Depth mandatory Write a function that measures the depth of a node in a binary tree
-
Size mandatory Write a function that measures the size of a binary tree
-
Leaves mandatory Write a function that counts the leaves in a binary tree
-
Nodes mandatory Write a function that counts the nodes with at least 1 child in a binary tree
-
Balance factor mandatory Write a function that measures the balance factor of a binary tree
-
Is full mandatory Write a function that checks if a binary tree is full
-
Is perfect mandatory Write a function that checks if a binary tree is perfect
-
Sibling mandatory Write a function that finds the sibling of a node
-
Uncle mandatory Write a function that finds the uncle of a node