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. Tree: Preorder Traversal
  2. Discussions

Tree: Preorder Traversal

Sort 36 Discussions, By:

  • nonjosh
     + 0 comments

    Python3

    def preOrder(root):
    #Write your code here
    print(root.info, end=" ")
    if root.left is not None:
        preOrder(root.left)
    if root.right is not None:
        preOrder(root.right)

  • beniusij
     + 0 comments

    For Go users, are we expected to implement tree and get it populated as well? That's all I was given for this challenge and no "preOrder" function is in there. I could do it myself but I am rather curious as other challenges have main() already implemented.

    package main
import "fmt"

func main() {
 //Enter your code here. Read input from STDIN. Print output to STDOUT
}

  • sunpaq
     + 0 comments

    There is no Node struct/class define for Swift programming language !

  • sviveros05
     + 0 comments

    JavaScript

    function preOrder(root) {
    process.stdout.write((root.data).toString() + " ");
    if (root.left){
        preOrder(root.left);
    }
    if (root.right){
        preOrder(root.right);
    } 
}

  • fukinscud
     + 0 comments
    def preOrder(root):
    if not root:
        return
    print(root.info, end=' ')
    preOrder(root.left)
    preOrder(root.right)
Load more conversations