feat: add funcs to traverse bstree

This commit is contained in:
dudaodong committed 2022-02-23 19:34:35 +08:00
1 parent b2b6710a1b
commit 6b09da6e6e
3 files changed
+129 -2

No files matched your search

+16 -1
View File
@@ -10,7 +10,7 @@ import (
// BSTree is a binary search tree data structure in which each node has at most two children,
// which are referred to as the left child and the right child.
// In BSTree: leftNode < rootNode < rightNode
// type T should implments Compare function of lancetconstraints.Comparator interface
// type T should implements Compare function in lancetconstraints.Comparator interface.
type BSTree[T any] struct {
root *datastructure.TreeNode[T]
}
@@ -43,6 +43,21 @@ func (t *BSTree[T]) NodeLevel(node *datastructure.TreeNode[T]) int {
return int(math.Max(left, right)) + 1
}
// PreOrderTraverse traverse tree node in pre order
func (t *BSTree[T]) PreOrderTraverse() []T {
return preOrderTraverse(t.root)
}
// PostOrderTraverse traverse tree node in post order
func (t *BSTree[T]) PostOrderTraverse() []T {
return postOrderTraverse(t.root)
}
// InOrderTraverse traverse tree node in mid order
func (t *BSTree[T]) InOrderTraverse() []T {
return inOrderTraverse(t.root)
}
// Print the bstree structure
func (t *BSTree[T]) Print() {
maxLevel := t.NodeLevel(t.root)