You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
24 lines
668 B
24 lines
668 B
---
|
|
comments: true
|
|
icon: material/graph-outline
|
|
---
|
|
|
|
# Chapter 7. Tree
|
|
|
|
{ class="cover-image" }
|
|
|
|
!!! abstract
|
|
|
|
The towering tree, full of vitality with its roots deep and leaves lush, branches spreading wide.
|
|
|
|
It vividly demonstrates the form of data divide-and-conquer.
|
|
|
|
## Chapter contents
|
|
|
|
- [7.1 Binary tree](binary_tree.md)
|
|
- [7.2 Binary tree Traversal](binary_tree_traversal.md)
|
|
- [7.3 Array Representation of tree](array_representation_of_tree.md)
|
|
- [7.4 Binary Search tree](binary_search_tree.md)
|
|
- [7.5 AVL tree *](avl_tree.md)
|
|
- [7.6 Summary](summary.md)
|