Git-Mirrors/master-algorithms-py
1
0
Fork 0
mirror of https://github.com/autistic-symposium/master-algorithms-py.git synced 2025-04-30 04:36:08 -04:00
Code Issues Packages Projects Releases Wiki Activity

Update README.md

Browse Source
This commit is contained in:
marina 2023-08-03 15:39:36 -07:00 committed by GitHub
parent 50436468d3
commit 75eb7e2dd9
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 2 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
trees/README.md
View File

@ -7,6 +7,8 @@
<br> <br>
* **binary trees** are trees that have each up to 2 children. a node is called **leaf** if it has no children. * **binary trees** are trees that have each up to 2 children. a node is called **leaf** if it has no children.
* the **depth of node** is the number of edges from the tree's root node until the node.
* the **height of node** is the number of edges on the longest path between that node and a leaf. the **height of tree** is the height of its root node.
* a **complete tree** is a tree on which every level is fully filled (except perhaps for the last). * a **complete tree** is a tree on which every level is fully filled (except perhaps for the last).
* a **full binary tree** has each node with either zero or two children (and no node has only one child). * a **full binary tree** has each node with either zero or two children (and no node has only one child).
* a **perfect tree** is both full and complete (it must have exactly 2**k - 1 nodes, where k is the number of levels). * a **perfect tree** is both full and complete (it must have exactly 2**k - 1 nodes, where k is the number of levels).