## Data Structure Name: N-ary Tree
- #### Description:
- #### Variations:
- #### Diagram:
- #### General Use:
## Key Considerations
- #### Properties:
- Cannot use in-order traversal
- Preorder Traversal
- DFS
- Visit Root node first, then traverse left subtree rooted at its children one by one
- Post Order Traversal
- Traverse the subtree rooted at its children first and then visit the root node
- Level-order Traversal
- BFS
- #### Implementation Details:
| | [[Big O - Time Complexity]] | [[Big O - Space Complexity]] |
| ------ | --------------------------- | ---------------------------- |
| Access | | |
| Add | | |
| Delete | | |
| Search | | |
- #### General Tips
- #### Special Properties
## Specific Use Cases
- TBD