Why Go
- Case Studies
  
  Common problems companies solve with Go
- Use Cases
  
  Stories about how and why companies use Go
- Security
  
  How Go can help keep you secure by default
Learn
Docs
- Effective Go
  
  Tips for writing clear, performant, and idiomatic Go code
- Go User Manual
  
  A complete introduction to building software with Go
- Standard library
  
  Reference documentation for Go's standard library
- Release Notes
  
  Learn what's new in each Go release
Packages
Community
- Recorded Talks
  
  Videos from prior events
- Meetups
  
  Meet other local Go developers
- Conferences
  
  Learn and network with Go developers from around the world
- Go blog
  
  The Go project's official blog.
- Go project
  
  Get help and stay informed from Go
- Get connected

binary_tree

package

v0.0.0-...-ac1e4b7 Latest Latest Go to latest Published: Apr 27, 2025 License: MIT Imports: 1 Imported by: 0

Details

Valid go.mod file
Redistributable license
Tagged version
Stable version
Learn more about best practices

Repository

github.com/minicloudsky/leetcode-algorithm

Links

Open Source Insights

Documentation ¶

Index ¶

func InorderTraversal(root *TreeNode) []int
func MaxDepth(root *TreeNode) int
type TreeNode
- func InvertTree(root *TreeNode) *TreeNode

Constants ¶

This section is empty.

Variables ¶

This section is empty.

Functions ¶

func InorderTraversal ¶

func InorderTraversal(root *TreeNode) []int

func MaxDepth ¶

func MaxDepth(root *TreeNode) int

MaxDepth 递归计算左右子树的高度，然后+1

Types ¶

type TreeNode ¶

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

func InvertTree ¶

func InvertTree(root *TreeNode) *TreeNode

InvertTree 递归反转左右子树

Source Files ¶

View all Source files