Height or maximum depth of a binary tree in Go (Golang)

Table of Contents

Overview

The objective is to get the height of a binary tree. For example, if let’s say we have below binary tree

Then the height of the binary tree is 3 here.

Program

Below is the program for the same

package main
import (
"fmt"
)
type TreeNode struct {
Val int
Left *TreeNode
Right *TreeNode
}
func maxDepth(root *TreeNode) int {
if root == nil {
return 0
}
if root.Left == nil && root.Right == nil {
return 1
}
lHeight := maxDepth(root.Left)
rHeight := maxDepth(root.Right)
if lHeight >= rHeight {
return lHeight + 1
} else {
return rHeight + 1
}
}
func main() {
root := TreeNode{Val: 1}
root.Left = &TreeNode{Val: 2}
root.Left.Left = &TreeNode{Val: 4}
root.Right = &TreeNode{Val: 3}
root.Right.Left = &TreeNode{Val: 5}
root.Right.Right = &TreeNode{Val: 6}
height := maxDepth(&root)
fmt.Println(height)
}

Output

Note: Check out our Golang Advanced Tutorial. The tutorials in this series are elaborative and we have tried to cover all concepts with examples. This tutorial is for those who are looking to gain expertise and a solid understanding of golang – Golang Advance Tutorial

Also if you are interested in understanding how all design patterns can be implemented in Golang. If yes, then this post is for you –All Design Patterns Golang

golang