【lintcode笔记】在二叉查找树中插入节点

给定一棵二叉查找树和一个新的树节点，将节点插入到树中。

你需要保证该树仍然是一棵二叉查找树。

注意事项

You can assume there is no duplicate values in this tree + node.

//非递归方法
#include <stdio.h>
using namespace std;
/**
 * Definition of TreeNode:
 * class TreeNode {
 * public:
 *     int val;
 *     TreeNode *left, *right;
 *     TreeNode(int val) {
 *         this->val = val;
 *         this->left = this->right = NULL;
 *     }
 * }
 */
class Solution {
public:
    /**
     * @param root: The root of the binary search tree.
     * @param node: insert this node into the binary search tree
     * @return: The root of the new binary search tree.
     */
    TreeNode* insertNode(TreeNode* root, TreeNode* node) {
        // write your code here
        TreeNode* T;
        T = root;
        if (T == NULL){
            T = node;
            return T;
        }
        while(T) {
            if(node->val == T->val) {
                return T;
            }else if(node->val < T->val) {
                if(T->left == NULL) {
                    T->left = node;
                    return root;
                }
                else
                    T = T->left;
            }else {
                if(T->right == NULL) {
                    T->right = node;
                    return root;
                }
                else
                    T = T->right;
            }
        }
    }
};