tree (1091B)
1 # Tree 2 3 ## Basic concepts 4 5 - [node] 6 - [leaf] 7 - [internal_node] 8 - [ancestor] 9 - [root] 10 - [forest] 11 - [parent] 12 - [child] 13 - [height] 14 - [tree_unranked] 15 - [tree_ranked] 16 - [tree_ordered] 17 - [tree_binary] 18 - [tree_complete] 19 - [tree_binary_full] 20 - [tree_rooted] 21 - [tree_unrooted] 22 - [tree_balanced] 23 - [path] 24 - [downward_path] 25 26 ## [Algorithms] on [trees] 27 28 - [tree_traversal] 29 - [prefix_order], [postfix_order], [infix_order] 30 31 ## Advanced concepts 32 33 - [strahler_number] 34 35 ## Special cases 36 37 - [tree_even] and [tree_odd] 38 - [graceful_tree] 39 40 ## Applications to other fields 41 42 - [tree_applications] 43 - [xml], [xpath] 44 45 ## [Data_structures] 46 47 - [tree_balancing] 48 - [splay_tree] 49 - [top_tree] 50 - [level_ancestor] 51 52 ## Related notions and application cases in [TCS] 53 54 - [heap] 55 - [binary_search_tree] 56 - [tree_automaton] 57 - [range_tree] 58 - [tree_decomposition] 59 - [universal_tree] 60 61 ## Decomposition of trees 62 63 - [centroid_decomposition] 64 - [heavy_light_path_decomposition] 65 66 ## [Generalizations] 67 68 - [polytree] 69 - [multitree] 70 - [out_tree] as a [directed_graph] 71 72 Up: [data_structure] 73 74 See also: [treewidth], [forest] 75 76 Aliases: trees