 a node is a basic unit used in computer science. nodes are devices or data points on a larger network. devices such as a personal computer, cell phone, or printer are nodes. when defining nodes on the internet, a node is anything that has an ip address. nodes are individual parts of a larger data structure, such as linked lists and tree data structures. nodes contain data and also may link to other nodes. links between nodes are often implemented by pointers.  ==nodes and trees==  nodes are often arranged into tree structures. these structures are binary trees. a node represents the information contained in a single structure. these nodes may contain a value or condition, or possibly serve as another independent data structure. nodes are represented by a single parent node. the highest point on a tree structure is called a root node, which does not have a parent node, but serves as the parent or 'grandparent' of all of the nodes below it in the tree. the height of a node is determined by the longest path from root node to the furthest leaf node, and the height of the tree is equal to the height of the root node. node depth is determined by the distance between that particular node and the root node. the root node is said to have a depth of zero. data can be discovered along these network paths. an ip address uses this kind of system of nodes to define its location in a network.  ===definitions=== *child: a child node is a node extending from another node. for example, a computer with internet access could be considered a child node of a node representing the internet. the inverse relationship is that of a parent node. if node c is a child of node a, then a is the parent node of c. *degree: the degree of a node is the number of children of the node. *depth: the depth of node a is the length of the path from a to the root node. the root node is 
Data_structures