平衡二元搜索樹問題

Question

我是新來的C++和我剛剛創建了一個平衡的二叉搜索樹，我只是 有幾個問題。

1) What is the efficiency of inserting/looking up/ removing/ from an ideally balanced binary tree is big-O of? 
2) How would I order A.go left, B. go right, C visit in pre-order, in-order and post-order traversal? 
3) Last question is infinite recursion is one cause of an infinite loop? 

在此先感謝

Answer 1

1) The efficiency of inserting/looking up/ removing is O(log2(n)) 
if you didn't understand that I would recommend googling it 
2) Pre-Order : Visit, go left and visit until leaf is reached, then go up and right & visit. Then repeat going left and visiting. 
    In order : Go to the left most child and visit, then go up and visit, then go right and visit. repeat from start. 
    Post- Order: A (visit last) A->B->C 
3) And recursion isn't a loop. 
I would recommend googling all these questions/ wiki has good information about binary  search tree