Binary Tree Node Structure in DSA Go - Build from Scratch

Binary Tree Node Structure

📖 Scenario: Imagine you are building a simple family tree app. Each person can have up to two children. You want to create the basic structure to hold each person and their children.

🎯 Goal: Create a binary tree node structure in Go to represent a person and their two children.

📋 What You'll Learn

Define a struct called TreeNode with an integer field Value

Add two pointer fields Left and Right of type *TreeNode

Create a root node with value 10

Assign left child with value 5 and right child with value 15

Print the root node's value and its children's values

💡 Why This Matters

🌍 Real World

Binary trees are used in many applications like organizing data, searching quickly, and representing hierarchical relationships such as family trees or file systems.

💼 Career

Understanding how to create and manipulate tree structures is important for software development roles involving data organization, algorithms, and system design.

1

Define the TreeNode struct

Define a struct called TreeNode with an integer field Value and two pointer fields Left and Right of type *TreeNode.

DSA Go

// Define the TreeNode struct here
// Your code here

Hint

Use type TreeNode struct {} to define the structure. Inside, add Value int, Left *TreeNode, and Right *TreeNode.

2

Create the root node and children

Inside main, create a variable root of type *TreeNode with Value 10. Then assign its Left child with a TreeNode of Value 5 and its Right child with a TreeNode of Value 15.

DSA Go

package main

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

func main() {
    // Create root node with Value 10
    // Assign Left child with Value 5
    // Assign Right child with Value 15
    // Your code here
}

Hint

Use &TreeNode{Value: 10} to create a pointer to a new node. Assign children similarly.

3

Add a helper variable for printing

Create a variable called nodes as a slice of pointers to TreeNode containing root, root.Left, and root.Right.

DSA Go

package main

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

func main() {
    root := &TreeNode{Value: 10}
    root.Left = &TreeNode{Value: 5}
    root.Right = &TreeNode{Value: 15}
    // Create nodes slice with root, root.Left, root.Right
    // Your code here
}

Hint

Use a slice literal like nodes := []*TreeNode{root, root.Left, root.Right}.

4

Print the values of root and its children

Use a for loop with variable node to iterate over nodes and print each node's Value using fmt.Println(node.Value). Import fmt package at the top.

DSA Go

package main

import "fmt"

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

func main() {
    root := &TreeNode{Value: 10}
    root.Left = &TreeNode{Value: 5}
    root.Right = &TreeNode{Value: 15}
    nodes := []*TreeNode{root, root.Left, root.Right}
    // Print each node's Value
    // Your code here
}

Hint

Use for _, node := range nodes and inside the loop fmt.Println(node.Value).