Learn Data Structures and Algorithms with Golang

Treeset.bst

The TreeNode's can be updated by accessing treeset.bst and traversing the binary search tree from the rootNode and the left and right nodes of rootNode, as shown here:

  var treeset *TreeSet = &TreeSet{}  treeset.bst = &BinarySearchTree{}   var node1 TreeNode = TreeNode{8, 8, nil, nil}  var node2 TreeNode = TreeNode{3, 3, nil, nil}  var node3 TreeNode = TreeNode{10, 10, nil, nil}  var node4 TreeNode = TreeNode{1, 1, nil, nil}  var node5 TreeNode = TreeNode{6, 6, nil, nil}  treeset.InsertTreeNode(node1, node2, node3, node4, node5)  treeset.String()

In the next section, we will take a look at sequences.