N-ary Trees for C Programming Language
- 1. N-ary Tree Tutorial and Code Review: N-ary Tree creation N-ary Tree node insertion N-ary Tree node verification N-ary Tree node freeing github path for files: https://github.com/johndspence/n_trees.git files: ntree_insert.c, path_exists.c, and ntree_free.c Files should be compiled on Ubuntu 14.04 LTS, using gcc (Ubuntu 4.8.4-2ubuntu1~14.04) 4.8.4 Holberton School 20160816 John Spence
- 2. Overview • This presentation demonstrates how to create an N-ary Tree/insert a new node, validate if a node exists, and finally “free” the N-ary Tree. “N tree” and “N-ary tree” are used interchangeably in this presentation. • The code was written in C, for ubuntu 14.04. • Source files are here: https://github.com/johndspence/n_trees.git • This presentation was given in the context of a code review for the Holberton School in San Francisco. • The tasks themselves were written by Alex Gautier: https://github.com/Mattrack
- 3. Task 0: N Tree Insert
- 4. Task 0: N Tree Insert (example)
- 5. Task 0: N Tree Insert (Expected Output)
- 7. 4 Scenarios that ntree_insert traversal logic must address
- 8. Insert a new node into the n-tree
- 9. Insert a new node into the n-tree: codeTask 0: N Tree Insert (Code)
- 10. Task 1: Determine if an N Tree path/node exists
- 11. Task 1: Determine if an N Tree path/node exists (example)
- 12. Task 1: Determine if an N Tree path/node exists (Expected Output)
- 13. Determine if a path exists using: path_exists in an n-tree
- 14. Determine if a path exists in a n-tree: code
- 15. Task 2: Free an N Tree
- 16. Free an n-tree
- 17. Free an n-tree: code