How to Validate Binary Search Tree in C/C++? April 13, 2016 algorithms, c / c++, data structure, Recursion No Comments Given a binary tree root, return whether it’s a binary search tree. A binary tree node is a binary search tree if : All nodes on its left subtree … [Continue Reading...]
How to Delete a Node from a Binary Search Tree? April 11, 2016 algorithms, c / c++, coding exercise, data structure 4 Comments A Binary Search Tree (BST) is a binary tree that satisfies the following requirements: The value of a parent node is bigger than all values of its left sub … [Continue Reading...]