kean

Problem 4.9. BST Sequences: A binary search tree was created by traversing through an array from left to right and inserting each element. Given a binary search tree with distinct elements, print all possible arrays that could have led to this tree.

Solution.

Let's start with an example.

    4
   / \
  2   5 

migf1

#include <stdio.h>    		/* getchar() */
#include <stdlib.h>		/* malloc(), realloc() */
#include <string.h>		/* memcpy() */

/* -----------------------------------------------
 * Create a new string (NUL-terminated array of chars) by reading the stdin.
 * Return the newly created string, or NULL on error.
 * Args:
 *	int beExact:	If 0 (false), then the size of the created string will
 *			be an exact multiple of the internally used alloc-ahead

btmills

#include <stdio.h>
#include <stdlib.h>

/*
 * Similar to fgets(), but handles automatic reallocation of the buffer.
 * Only parameter is the input stream.
 * Return value is a string. Don't forget to free it.
 */
char* ufgets(FILE* stream)
{