项目作者: nilayan

项目描述 :
Binary search tree
高级语言: JavaScript
项目地址: git://github.com/nilayan/binary-search-tree.git
创建时间: 2018-04-16T01:43:47Z
项目社区:https://github.com/nilayan/binary-search-tree

开源协议:MIT License

下载


binary-search-tree

Binary search tree implementation using recursion for insertion, search, and traversal.

Sample run

Starting with root value 4, then inserting values 2, 1, 5, 3

  1. new BST: 4
  2. insert: 2 <= 4 Go LEFT
  3. insert: 4.left is 2
  4. new BST: 2
  5. insert: 1 <= 4 Go LEFT
  6. insert: 4.left subtree
  7. insert: 1 <= 2 Go LEFT
  8. insert: 2.left is 1
  9. new BST: 1
  10. insert: 5 > 4 Go RIGHT
  11. insert: 4.right is 5
  12. new BST: 5
  13. insert: 3 <= 4 Go LEFT
  14. insert: 4.left subtree
  15. insert: 3 > 2 Go RIGHT
  16. insert: 2.right is 3
  17. new BST: 3
  18. search: 5 > 4 Go RIGHT
  19. search: 4.right subtree
  20. search: Found value 5
  21. in-order: 1 [leaf]
  22. in-order: 2
  23. in-order: 3 [leaf]
  24. in-order: 4
  25. in-order: 5 [leaf]
  26. pre-order: 4
  27. pre-order: 2
  28. pre-order: 1 [leaf]
  29. pre-order: 3 [leaf]
  30. pre-order: 5 [leaf]
  31. post-order: 1 [leaf]
  32. post-order: 3 [leaf]
  33. post-order: 2
  34. post-order: 5 [leaf]
  35. post-order: 4