Binary Tree
1. traverse
2. path
3. serialization
4. reconstruct tree from traverse
binary tree reconstruct tree from traverse
5. conversion between tree and linked list
binary tree conversion between tree and linked list
6. misc
7. cloest value
Tnode * closestBST(Tnode * root, int val){
if(root->val == val)
return root;
if(val < root->val){
if(!root->left)
return root;
Tnode * p = closestBST(root->left, val);
return abs(p->val-val) > abs(root->val-val) ? root : p;
}else{
if(!root->right)
return root;
Tnode * p = closestBST(root->right, val);
return abs(p->val-val) > abs(root->val-val) ? root : p;
}
return null;
}
Post preview:
Close preview