algorithm_cpp/binary_tree at main · caonann/algorithm_cpp · GitHub

Name		Name	Last commit message	Last commit date
parent directory ..
binary_indexed_tree		binary_indexed_tree
segementtree		segementtree
1382.balanceBST.cpp		1382.balanceBST.cpp
145.postorderTraversal.cpp		145.postorderTraversal.cpp
236.lowestCommonAncestor.cpp		236.lowestCommonAncestor.cpp
47.cpp		47.cpp
48.cpp		48.cpp
49.cpp		49.cpp
50.cpp		50.cpp
51.cpp		51.cpp
52.cpp		52.cpp
53.cpp		53.cpp
54.cpp		54.cpp
55.cpp		55.cpp
56.cpp		56.cpp
57.cpp		57.cpp
58.MyCalendar.cpp		58.MyCalendar.cpp
7.rebuildTree.cpp		7.rebuildTree.cpp
README.md		README.md
traverse.h		traverse.h
traverse_uinttest.cpp		traverse_uinttest.cpp

README.md

dfs 前序遍历，先根节点在左右，root->左->右中序遍历，先左在根在右，左->root->右后序遍历，先左在右在根，左->右->root 完全二叉树的基本性质红黑树的基本性质

二叉树的深度h的最小值是log2（n+1），最大值为n 以前序遍历的顺序遍历二叉树最适合序列化