C++ (Cpp) inorderTrav Examples

Example #1

File: convert_sorted_array_to_BST.c Project: zjc-enigma/leetcode

void inorderTrav(struct TreeNode *root)
{
    if(!root) {
        return ;
    }
    printf("%d\n", root->val);
    inorderTrav(root->left);
    inorderTrav(root->right);
}

Example #2

File: convert_sorted_array_to_BST.c Project: zjc-enigma/leetcode

int main()
{

    int arr[] = {1,2,3,4,5,6,7};
    struct TreeNode *r = sortedArrayToBST(arr, 7);
    inorderTrav(r);
    return 0;
}

Example #3

File: BST.cpp Project: DArtagan/csci262

void BST<Item, Key>::inorder(Function m) {
	inorderTrav(root,m);
}

Example #4

File: BST.cpp Project: DArtagan/csci262

void BST<Item, Key>::inorderTrav(Node* ptr,Function n) {
	if (ptr == NULL) return;
	inorderTrav(ptr->left,n);
	n(ptr->data);
	inorderTrav(ptr->right,n);
}