# I am the Watcher. I am your guide through this vast new twtiverse.
# 
# Usage:
#     https://watcher.sour.is/api/plain/users              View list of users and latest twt date.
#     https://watcher.sour.is/api/plain/twt                View all twts.
#     https://watcher.sour.is/api/plain/mentions?uri=:uri  View all mentions for uri.
#     https://watcher.sour.is/api/plain/conv/:hash         View all twts for a conversation subject.
# 
# Options:
#     uri     Filter to show a specific users twts.
#     offset  Start index for quey.
#     limit   Count of items to return (going back in time).
# 
# twt range = 1 1
# self = https://watcher.sour.is/conv/agctm6a
yue-fang-readfog-go
feeds.twtxt.net
View Thread
沒想到 Go 實現排序二叉樹如此簡單！**
1、概述排序二叉樹，也稱爲二叉搜索樹，是一種經典的數據結構。它不僅是一種二叉樹，還滿足左子樹的所有節點值小於根節點，右子樹的所有節點值大於根節點的條件。這個特性使得排序二叉樹具有高效的搜索、插入和刪除操作。2、排序二叉樹的基本概念排序二叉樹（Binary Search Tree，BST）是一種二叉樹，它的每個節點包含一個鍵值，同時滿足左子樹的所有節點值小於該節點的值，右子樹的所有節點值大於該節點的 ⌘ Read more