TREE

 - Node at the top is called as root.
- A line connecting the parent to the child is edge.
- Nodes that do not have children are called leaf.
- Nodes that have the same parent are called sibling.
- Degree of node is the total sub tree of the node.
- Height/Depth is the maximum degree of nodes in a tree.

- If there is a line that connects p to q, then p is called the ancestor of q, and q is a descendant of p.
BINARY TREE

- Binary tree is a rooted tree data structure in which each node has at most two children
- Those two children usually distinguished as left child and right child.
- Node which doesn’t have any child is called leaf.

Image result for tree in c

Comments

Post a Comment

Popular posts from this blog

Image
HASHING  - Hashing is a technique used for storing and retrieving keys in a rapid manner. - In hashing, a string of characters are transformed into a usually shorter length value or key that represents the original string. - Hashing is used to index and retrieve items in a database because it is faster to find item using shorter hashed key than to find it using the original value. - Hashing can also be defined as a concept of distributing keys in an array called a hash table using a predetermined function called hash function. HASH TABLES - Hash table is a table (array) where we store the original string. Index of the table is the hashed key while the value is the original string. - The size of hash table is usually several orders of magnitude lower than the total number of possible string, so several string might have a same hashed-key.
Read more