Home Terms and Types Binary Trees Traversals Quiz

Tree: A Connected Graph that contains no simple circuits is called a tree. Trees are the most common hierarchial data structures used. They are non linear, two dimensional data structures. A tree is an unconnected graph, it is acyclic and connected. Graph: Graphs are discrete structure consisting of vertices and edges that connect this vetices Node: A node may contain a value or a condition or represents a seperate data structure or a tree of its own. Rootnode: The topmost node in a tree is called the rootnode. Being the topmost node, the root node will not have any parents. All the operations on a tree commonly begin at the rootnode. Here the Rootnode is R. Leaf Nodes: Nodes at the bottom-most level of a tree are called leaf nodes. Since the are at the bottom-most level, they dont have any children. Here nodes S,L,C,U and Z are leaf nodes. Child and Parent Nodes: Each node in a tree has 0 or more child nodes. A node that has a child is called the child's Parent node. A node has atmost one parent. Here A & T are the child nodes of root node R. P is the parent node of nodes S,L,C and S is the sibling of L & C                                                                                                                                                                                      NEXT