# 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/xztddxq
yue-fang-readfog-go
feeds.twtxt.net
View Thread
二叉樹、紅黑樹以及 Golang 實現紅黑樹**
二叉搜索樹（二叉查找樹）------------二叉查找樹也叫二叉搜索樹，也叫二叉排序樹，它具有以下特點：1\\. 如果左子樹不爲空，則左子樹上的結點的值都小於根節點；2. 如果右子樹不爲空，則右子樹上的結點的值都大於根節點；3. 子樹同樣也要遵循以上兩點。二叉樹的遍歷方式二叉樹的遍歷方式：前序遍歷、中序遍歷、後序遍歷和層序遍歷（MySql）。只要一棵樹是二叉查找樹，那麼它的中序遍歷（左根右輸出）一定 ⌘ Read more