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

split_bst

package

v1.4.2 Latest Latest Go to latest Published: Jul 8, 2019 License: MIT Imports: 0 Imported by: 0

Details

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

Repository

github.com/openset/leetcode

Links

Open Source Insights

README ¶

< Previous 　　　　　　　　　　　　　　　　 Next >

776. Split BST (Medium)

[Tree] [Recursion]

Similar Questions

Delete Node in a BST (Medium)

Hints

Hint 1

Use recursion. If root.val <= V, you split root.right into two halves, then join it's left half back on root.right.

Documentation ¶

The Go Gopher

There is no documentation for this package.

Source Files ¶

View all Source files

split_bst.go