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