DATA STRUCTURES
4.3 TREES 

DATA STRUCTURES
4.3 TREES 

ROOT: The node at the top of the tree
PARENT: Any node that has a child node below LEFTCHILD: The node on the left below a parent RIGHTCHILD: The node on the right below a parent SUBTREE: A branch to the left or right of a parent that has at least one child of its own. LEAF: The last nodes at the bottom of the tree 



We can think of Inorder traversal as visiting the node on the second visit. A leaf nodes second visit would be after checking the null value of branches, so it may be actually be the first visit however we can still view it as the second visit as it traverses the null value.
1: Traverse Left 2: Visit Node 3: Traverse Right 


SUGGESTIONS
We would love to hear from you 
SUBSCRIBE
To enjoy more benefits 