Home
Terms and Types
Binary Trees
Traversals
Quiz

    Internal Node:
      Internal Node or inner node is any node of a tree that has child nodes and this is not a leaf node. Here T is an Internal Node.
    Height and Depth:
      It is the number of nodes which must be traversed from the root to reach a leaf of a tree. Normally the height of a root node is the height of a tree.Here the height is 3.Depth of a node is the length of the path to its root.
    Free Tree:
      A free tree is a connected acyclic graph. It is connected, in that any node in the graph can be reached from any other node by exactly one path.
      SHOW
    Binary Tree:
      A A binary Tree is a tree data structure in which each node has atmost 2 children.
      SHOW

    Red Black Tree:
      A red-black tree is a binary search tree where each node has a color attribute, the value of which is either red or black.
      SHOW

                                                                                                                                                                                         PREVIOUS