@@ -10,24 +10,26 @@ _Read this in other languages:_
1010* [ Segment Tree] ( segment-tree ) - with min/max/sum range queries examples
1111* [ Fenwick Tree] ( fenwick-tree ) (Binary Indexed Tree)
1212
13- In computer science, a ** tree** is a widely used abstract data
14- type (ADT) — or data structure implementing this ADT—that
15- simulates a hierarchical tree structure, with a root value
16- and subtrees of children with a parent node, represented as
13+ In computer science, a ** tree** is a widely used abstract data
14+ type (ADT) — or data structure implementing this ADT—that
15+ simulates a hierarchical tree structure, with a root value
16+ and subtrees of children with a parent node, represented as
1717a set of linked nodes.
1818
19- A tree data structure can be defined recursively (locally)
20- as a collection of nodes (starting at a root node), where
21- each node is a data structure consisting of a value,
22- together with a list of references to nodes (the "children"),
23- with the constraints that no reference is duplicated, and none
19+ A tree data structure can be defined recursively (locally)
20+ as a collection of nodes (starting at a root node), where
21+ each node is a data structure consisting of a value,
22+ together with a list of references to nodes (the "children"),
23+ with the constraints that no reference is duplicated, and none
2424points to the root.
2525
2626A simple unordered tree; in this diagram, the node labeled 7 has
2727two children, labeled 2 and 6, and one parent, labeled 2. The
2828root node, at the top, has no parent.
2929
30- ![ Tree] ( https://upload.wikimedia.org/wikipedia/commons/f/f7/Binary_tree.svg )
30+ ![ Tree] ( ./images/tree.jpeg )
31+ 32+ * Made with [ okso.app] ( https://okso.app ) *
3133
3234## References
3335
0 commit comments