Breaking News: Grepper is joining You.com. Read the official announcement!

binary search tree inorder traversal golang

Add Answer

Tired Termite answered on April 30, 2022 Popularity 3/10 Helpfulness 2/10

answer binary search tree inorder traversal golang

related inorder traversal golang

related preorder traversal golang

binary search tree inorder traversal golang

Comment

package main
 
import "fmt"
 
type Node struct {
	val   int
	left  *Node
	right *Node
}
 
func InorderRecursive(root *Node) {
	if root == nil {
		return
	}
 
	InorderRecursive(root.left)
	fmt.Printf("%d ", root.val)
	InorderRecursive(root.right)
}
 
func main() {
	/*
				10
			   /  \
			 20	   30
			/ \      \
		   40  50     60
		  /
		 70
	*/
 
	root := &Node{10, nil, nil}
	root.left = &Node{20, nil, nil}
	root.right = &Node{30, nil, nil}
	root.left.left = &Node{40, nil, nil}
	root.left.right = &Node{50, nil, nil}
	root.right.right = &Node{60, nil, nil}
	root.left.left.left = &Node{70, nil, nil}
 
	fmt.Println("Inorder Traversal - recursive solution : ")
	InorderRecursive(root)
}

Popularity 3/10 Helpfulness 2/10 Language go

Source: www.code2succeed.com

Tags: binary-search-tree go inorder traversal

Link to this answer
Share Copy Link

Contributed on May 18 2022

Tired Termite

0 Answers Avg Quality 2/10

Closely Related Answers

inorder traversal golang

Comment

type TreeNode struct {
  Val int
  Left *TreeNode
  Right *TreeNode
}

func inOrderTraverse(root *TreeNode) int[] {
  list := []int {}
  if root == nil {
    return list
  }
  
  stack := []*TreeNode { }
  for root != nil || len(stack) > 0 {
    
    for root != nil {
      stack = append(stack, root)
      root = root.Left
    }
    
    root = stack[len(stack) - 1]
    stack = stack[0:len(stack) - 1]
    list = append(list, root.Val)
    root = root.Right
  }
  
  return list
}

Popularity 4/10 Helpfulness 3/10 Language go

Source: Grepper

Tags: traversal go inorder

Link to this answer
Share Copy Link

Contributed on Apr 30 2022

Ibrahim Albarghouthi

0 Answers Avg Quality 2/10

preorder traversal golang

Comment

type TreeNode struct {
  Val int
  Left *TreeNode
  Right *TreeNode
}

func preOrderTraverse(root *TreeNode) int[] {
  list := []int {}
  if root == nil {
    return list
  }
  
  stack := []*TreeNode { root }
  for len(stack) > 0 {
    root = stack[len(stack) - 1]
    stack = stack[0:len(stack) - 1]
    list = append(list, root.Val)

    if root.Left != nil {
      stack = append(stack, root.Left)
    }
    
    if root.Right != nil {
      stack = append(stack, root.Right)
    }
  }
  
  return list
}

Popularity 4/10 Helpfulness 1/10 Language go

Source: Grepper

Tags: preorder traversal go

Link to this answer
Share Copy Link

Contributed on Apr 30 2022

Ibrahim Albarghouthi

0 Answers Avg Quality 2/10

binary search tree inorder traversal golang

Contents

More Related Answers

binary search tree inorder traversal golang

Closely Related Answers

inorder traversal golang

preorder traversal golang

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.