Binary Tree Implementation of Golang
The code contains a set of functions that will help you work with binary trees. See the implementation of the code below.
t := &TreeNode{val: 8}
t.Insert(1)
t.Insert(2)
t.Insert(3)
t.Insert(4)
t.Insert(5)
t.Insert(6)
t.Insert(7)
t.Find(11)
t.Delete(5)
t.Delete(7)
t.PrintInorder()
- Puneeth S - Initial work - puneeth8994