We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Data Structures
  3. Trees
  4. Tree: Preorder Traversal
  5. Discussions

Tree: Preorder Traversal

  • dvcrn
     + 9 comments

    I have no idea about Java but it was fairly simple to traverse the tree without any knowledge of the language:

    You always start left, then go right. Recurse deeper and print the value

    void Preorder(Node root) {
    System.out.print(root.data + " ");

    if (root.left != null) {
        Preorder(root.left);
    } 
    
    if (root.right != null) {
        Preorder(root.right);
    }
}