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