tree (1213B)
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 - [tree_labeled] 26 - [lowest_common_ancestor] 27 28 ## [Algorithms] on [trees] 29 30 - [tree_traversal] 31 - [prefix_order], [postfix_order], [infix_order] 32 - [lowest_common_ancestor_problem] 33 34 ## Advanced concepts 35 36 - [strahler_number] 37 38 ## Special cases 39 40 - [tree_even] and [tree_odd] 41 - [graceful_tree] 42 43 ## Applications to other fields 44 45 - [tree_applications] 46 - [xml], [xpath] 47 48 ## [Data_structures] 49 50 - [tree_balancing] 51 - [splay_tree] 52 - [top_tree] 53 - [level_ancestor] 54 55 ## Related notions and application cases in [TCS] 56 57 - [heap] 58 - [binary_search_tree] 59 - [tree_automaton] 60 - [range_tree] 61 - [tree_decomposition] 62 - [universal_tree] 63 64 ## Decomposition of trees 65 66 - [centroid_decomposition] 67 - [heavy_light_path_decomposition] 68 69 ## [Generalizations] 70 71 - [polytree] 72 - [multitree] 73 - [out_tree] as a [directed_graph] 74 - [tree_weighted] 75 76 Up: [data_structure] 77 78 See also: [treewidth], [forest], [top_down], [bottom_up] 79 80 Aliases: trees